Back to the 2025 paper
Similar questions
FORMAL 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 DFA20252mFormal Language & Automata TheoryDesign a turing machine that accepts all palindromes over \Sigma = \{a, b\}.20207mFormal 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
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