Given a NFA with N states, the maximum number of states in an equival – McqOptions

MCQOPTIONS

1.	Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.
A.	N2
B.	2N
C.	2N
D.	N!
Answer» C. 2N

Discussion

No Comment Found

Related MCQs

If ∑ = {a, b, c, d, e, f} then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is
Which of the following are not regular?
Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.
Which of the following pairs of regular expressions are equivalent?
Consider the following two statements. Which of the following is true?
An FSM with __________
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’.