(A) True
(B) False
(C) NA
(D) NA
Tag: Theory of Automata
A DFA with n states must accept at least one string of length greater than n?
(A) True
(B) False
(C) NA
(D) NA
A production is called null able production if it is of the form N → Λ?
(A) True
(B) False
(C) False
(D) False
Who did not invent the Turing machine?
(A) Alan Turing
(B) A. M. Turing
(C) Turing
(D) None of these
The production of the form non terminal → Λ is said to be null production?
(A) True
(B) False
(C) Depends on the language
(D) None of given
A regular language?
(A) Must be finite
(B) Must be infinite
(C) Can be finite or infinite
(D) Must be finite and cannot be infinite
The language generated by that CFG is regular if __.
(A) No terminal → semi word
(B) No terminal → word
(C) Both a and b
(D) None of given
The CFG is said to be ambiguous if there exists atleast one word of its language that can be generated by the different production trees,?
(A) True
(B) False
(C) Depends on the language
(D) None of the given options