M

Mr. Dubey • 100.69K Points
Coach

Q. A language is regular if and only if

  • (A) Accepted by DFA
  • (B) Accepted by PDA
  • (C) Accepted by LBA
  • (D) Accepted by Turing machine
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. First Order Logic is also known as ___________

Q. A executes the loop task first, then tests a condition and repeats the task until the condition fails.

Q. Behavioral specification is required for:

Q. The is essentially used to search for patterns in target string.

Q. THE GLITCHES DUE TO RACE CONDITION CAN BE AVOIDED BY USING A

Q. Let P(S) denote the power set of set S. which of the is always true

Q. Which of the following is a read only memory storage device?

Q. computer system capable of integrating, storing, editing, analyzing, sharing, and displaying geographically referenced (spatial) information

Q. Network layer firewall has two sub- categories as

Q. In which of the following cases, the maximum sum rectangle is the 2D matrix itself?

Question analytics