(A) (a+b)+
(B) a-b
(C) (a-b)+
(D) None of them
Tag: Theory of Automata Mcqs
In CFG, the symbols that cannot be replaced by anything are called __.
(A) None terminals
(B) Infinite
(C) Finite
(D) Terminals
The language generated by the CFG is called the language __ by the CFG.
(A) Produced
(B) Null string
(C) Pumping lemma
(D) Non of then
L is a regular language so by kleene,s theorem ,there exists an __.
(A) FA
(B) GTG
(C) TG
(D) CNF
According to Mayhill Nerode theorem, if L generates finite no. of classes then L is __.
(A) Regular
(B) Nonregular
(C) Infinite
(D) Infinite
Any word generated by given CFG cannot also be expressed by Syntax tree or Generation tree or Derivation tree as well?
(A) True
(B) False
(C) NA
(D) NA
the moment a final state of __ FA is entered ,the possibility of the initial state of __ FA will be included as well.
(A) first ,third
(B) first ,second
(C) second ,third
(D) all of above
If the intersection of two regular languages is regular then the complement of the intersection of these two languages is also regular:
(A) True
(B) False
(C) NA
(D) NA