Back to the 2020 paper
Similar questions
Formal Language & Automata TheoryDiscuss the power and limitations of Turing Machines. Compare Turing Machines with Pushdown Automata.20257mFormal Language & Automata TheoryA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20202mFormal Language & Automata TheoryContext-Free Grammars are equivalent to (i) Finite Automata (ii) Turing Machines (iii) Linear Bounded Automata (iv) Pushdown Automata20252mFORMAL LANGUAGE & AUTOMATA THEORYA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20232m
PreviousA _____ 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 aboveNextLet L = \{w \mid w \in \{0+1\}^*, w \text{ has even number of 1s}\}. Which one of the regular expression below represents L? (i) (0^* 10^* 1)^* (ii) 0^*(10^* 10^*)^* (iii) 0^* (10^* 1^*)^* 0^* (iv) 0^* 1(10^* 1)^* 10^*