Back to the 2025 paper
Similar questions
FORMAL 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 THEORYWhich of the following is a PDA? (i) Finite automaton with a stack (ii) Turing machine with a stack (iii) Finite automaton with a queue (iv) Turing machine with a queue20242mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following languages is NOT regular? (i) {a^n b^n | n \ge 0} (ii) {a, b}* (iii) Finite languages (iv) Languages accepted by DFA20252mFormal Language & Automata TheoryConsider the following finite state automaton:  The language accepted by this automaton is given by the regular expression (i) b^*ab^*ab^*ab (ii) (a+b)^* (iii) b^*a(a+b)^* (iv) b^*ab^*ab20192m