Back to the 2022 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORY____ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212mFormal Language & Automata Theory\_\_\_\_ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212mFormal Language & Automata TheoryA _____ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above20202mFormal Language & Automata TheoryA ___________ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above20222m
PreviousIf L1 and L2 are context free languages, L1 - L2 is ___________ context-free. (i) always (ii) sometimes (iii) never (iv) None of theseNextWhich of the following pairs of regular expressions are equivalent? (i) x^* and x^*x (ii) 1(01)^* and (10)^*1 (iii) x(xx)^* and (xx)^*x (iv) All of the above
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.