Back to the 2024 paper
Similar questions
Formal Language & Automata TheoryEpsilon (\varepsilon) transitions are allowed in (i) DFA only (ii) Both DFA and NFA (iii) NFA only (iv) None20252mFORMAL LANGUAGE & AUTOMATA THEORYDefine NFA with \varepsilon-transitions with an example.20247mFORMAL 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^n20212mFORMAL 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