(A) Abbbab
(B) Bbba
(C) ababbb
(D) bbbbab
Tag: Theory of Automata Mcqs
The states in which there is no way to leave after entry are called?
(A) Davey John Lockers
(B) Dead States
(C) Waste Baskets
(D) All of the given options
(a* + b*)* = (a + b)* this expression is __.
(A) True
(B) False
(C) NA
(D) NA
The structure given below is called __ S -> aA|bB A -> aS|a B -> bS|b.
(A) RE
(B) TG
(C) CFG
(D) PDA
If a CFG has only productions of the form nonterminal -> string of two nonterminals or nonterminal -> one terminal then the CFG is said to be in __.
(A) PDA form
(B) Chomsky Normal Form (CNF)
(C) NULL able form
(D) Unit production form
Consider the following CFG: (NOTE: ^ means NULL) S->a|Xb|aYa X->Y|^ Y->b|X Which Nonterminal(s) is/are NOT nullable?
(A) S
(B) X
(C) Y
(D) S,X and Y
The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by the __ production trees.
(A) One
(B) Two
(C) More than one
(D) At most one