Back to the 2022 paper
Module 1: Introduction, Regular languages and finite automata
20227m
Minimize the DFA shown in the following transition diagram:
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYGiven a DFA D over the alphabet {a, b}, perform DFA minimization and draw the equivalent minimal DFA accepting the same language. 20257mFORMAL LANGUAGE & AUTOMATA THEORYConvert the following NFA to DFA. 20247mFORMAL LANGUAGE & AUTOMATA THEORYObtain the regular expression for the given DFA. 20237mFORMAL LANGUAGE & AUTOMATA THEORYFor an NFA with n states, the minimized DFA has: (i) m \le 2^n (ii) n \le m (iii) one accept state (iv) m = 2^n20212m
PreviousConstruct the regular grammar accepting the following language: L = \{ w \in \{a, b\}^* / w \text{ is a string over } \{a, b\} \text{ such that the number of b's is } 3 \pmod 4 \}NextDefine recursively enumerable languages. Let L_1 be recursive and L_2 recursively enumerable. Show that L_2 - L_1 is necessarily recursively enumerable.