How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Mr. Dubey • 52.77K Points
Coach

Q. How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

(A) n+1

(B) n+2

(D) 2n

Correct Answer - Option(B)
Views: 432
Filed under category Theory of Computation

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

You must be Logged in to update hint/solution

Discusssion

Q. Which ‘time’ unit is not used in reliability studies?

Q. In the SSL record protocol operation pad_1 is –

Q. applications are great platforms for creating an environment rich, in visual feedback for the user.

Q. In which cycle the memory is read and the contents of memory at the address containedin the PC register are loaded into in to IR.

Q. A plan for receipts or disbursements (An) that yields a particular cash ﬂow pattern over a speciﬁed length of time is called monthly equal payment

Q. KPA in CMM stands for

Q. The anthropomorphic device may aim its gaze at the source of

Q. Which of the following algorithms is the best approach for solving Huffman codes?

Q. In ________ mode, the communication channel is used in both directions at the same time?

Q. How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?

Discusssion

Related MCQs

Question analytics