Back to the 2023 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYDefine NFA with \varepsilon-transitions with an example.20247mFormal Language & Automata TheoryEpsilon (\varepsilon) transitions are allowed in (i) DFA only (ii) Both DFA and NFA (iii) NFA only (iv) None20252mFormal 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 THEORYA DFA can have: (i) Multiple start states (ii) Multiple accepting states (iii) Transitions on \varepsilon (iv) None of the above20242m