Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryConvert the following NFA to DFA and informally describe the language it accepts. | State/input | 0 | 1 | |---|---|---| | \to p | {p, q} | {p} | | q | {r, s} | {t} | | r | {p, r} | {t} | | *s | \emptyset | \emptyset | | *t | \emptyset | \emptyset |20227mFORMAL LANGUAGE & AUTOMATA THEORYObtain the regular expression for the given DFA. 20237mFormal Language & Automata TheoryConvert the regular expression (a + b)abb(a + b) into an equivalent DFA. Show all steps.20257mFORMAL LANGUAGE & AUTOMATA THEORYGiven the \varepsilon-NFA, compute \varepsilon-closures and convert to DFA. | State | \varepsilon-transition | a-transition | b-transition | |-------|--------------------------|--------------|--------------| | → | {r} | {q} | {p,r} | | q | ∅ | {p} | ∅ | | r | {p,q} | {r} | {p} |20237m
PreviousProve using pumping lemma for regular languages that the language \{ 0^n / n \text{ is a perfect square} \} is not regular.NextConvert the following NFA to DFA and informally describe the language it accepts. | State/input | 0 | 1 | |---|---|---| | \to p | {p, q} | {p} | | q | {r, s} | {t} | | r | {p, r} | {t} | | *s | \emptyset | \emptyset | | *t | \emptyset | \emptyset |