(A) The PDA must have one accept state and one reject state
(B) The PDA must have one accept state and two reject state
(C) The PDA must have two accept state and two reject state
(D) There is no reject state in the PDA
Author:
Converting the given CFG in CNF is the first rule of __.
(A) CYK algorithm
(B) CKY algorithm
(C) KYC algorithm
(D) CNK algorithm
The production of the form nonterminal →string of two nonterminals is called a?
(A) live production
(B) dead production
(C) type of production
(D) none of them
Examin the following CFG and select the correct choice: S→ AB, A →BSB, B→ CC C→ SS A→ a|b C→ b|bb?
(A) abb is a word in the corresponding CFL
(B) abb is not the word of corresponding CFL
(C) any word can be accept from the corresponding CFL
(D) Non of these
Can a turing machine’s head ever be in the same location in two successive steps?
(A) True
(B) False
(C) True but only in finite languages
(D) True but only in infinite langauges
If w is large enough word in a CF then w can be decomposed into w =uvwxyz such that all words of the form uvn xynz belong to?
(A) CNF
(B) L
(C) CFL
(D) CFG
In FA starting state is represented by a __ sign.
(A) +
(B) –
(C) *
(D) S
NO164: If r1 = (aa + bb) and r2 = ( a + b) then the language (a + b)* (aa + bb)* will be generated by?
(A) (r2)(r1)
(B) (r1 + r2)*
(C) (r2)*(r1)*
(D) (r1)*