Back to the 2025 paper
Similar questions
Compiler DesignChoose the correct option / answer the following: Which of the following is NOT accepted by finite automata? (i) Palindromes (ii) Strings with even number of a's (iii) Binary strings divisible by 3 (iv) Strings ending with 'ab'20242mFormal Language & Automata TheoryShow given grammar over alphabet \{a, b\}, verify whether it is ambiguous or unambiguous: S \to aSa \mid bSb \mid a \mid b \mid \epsilon20217mFORMAL LANGUAGE & AUTOMATA THEORYConstruct DFA that accepts strings over \Sigma = \{a,b\} which start with aba.20247mFORMAL 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 DFA20252m
PreviousA Turing Machine that prints strings of a language is called (i) Acceptor (ii) Transducer (iii) Generator (iv) EnumeratorNextThe \epsilon-closure of a state is (i) The set of states reachable using \epsilon only (ii) The set of unreachable states (iii) The set of final states (iv) The dead states
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.