Back to the 2025 paper
Similar questions
FORMAL 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} |20237mFormal Language & Automata TheoryEpsilon (\varepsilon) transitions are allowed in (i) DFA only (ii) Both DFA and NFA (iii) NFA only (iv) None20252mFormal Language & Automata TheoryA language accepted by deterministic pushdown automata is closed under which of the following? (i) Complement (ii) Union (iii) Both (i) and (ii) (iv) None of the above20202mFORMAL LANGUAGE & AUTOMATA THEORYA DFA can have: (i) Multiple start states (ii) Multiple accepting states (iii) Transitions on \varepsilon (iv) None of the above20242m
PreviousIf \Sigma = \{a, b\}, then \Sigma^* contains (i) Only finite strings (ii) Only infinite strings (iii) All finite strings over \Sigma including \epsilon (iv) Only strings of equal lengthNextWhich of the following CFLs is deterministic? (i) {a^n b^n} (ii) Arithmetic expressions (iii) Palindromes (iv) {ww^R}