Back to the 2025 paper
Similar questions
Compiler DesignChoose the correct option / answer the following: Which grammar type is recognized by a push-down automaton? (i) Regular (ii) Context-free (iii) Context-sensitive (iv) Unrestricted20242mFormal Language & Automata TheoryThe lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? (i) Finite state automata (ii) Deterministic pushdown automata (iii) Non-deterministic pushdown automata (iv) Turing machine20202mFORMAL LANGUAGE & AUTOMATA THEORYA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded Automaton20252mFormal 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 above20202m
PreviousEpsilon (\varepsilon) transitions are allowed in (i) DFA only (ii) Both DFA and NFA (iii) NFA only (iv) NoneNextPumping Lemma for CFLs is used to prove a language is (i) Not Context-Free (ii) Regular (iii) Decidable (iv) Turing recognizable
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.