If a DFA has n states and the language contains any string of length – McqOptions

MCQOPTIONS

1.	If a DFA has n states and the language contains any string of length n or more, the language is termed as:
A.	Infinite
B.	Empty
C.	Non regular
D.	None of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

State true or false:Statement: If an n-state DFA accepts a string w of length n or more, then there must be a state that appears twice on the path labeled w from the start state to the final state.
If a DFA has n states and the language contains any string of length n or more, the language is termed as:
Suppose there is a string w=abbab, and there exists a DFA which accepts w. How many stepts will be required to test its membership?
Which of the following is a function of Closure properties?a) Helps construct representationsb) Helps show informally described languages not to be in classc) Both (
For an automata, which of the following are equivalent variants?DFA,NFA and NFA with epsilon transitions
Which of the following is a function of Closure properties?
Which of the following problems do not belong to decision properties?
Which of the following are not meant to specify a regular language?
Pick the odd one out of the given properties of a regular language:
Which of the following are decision properties?