Back to the 2024 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 DFA can have: (i) Multiple start states (ii) Multiple accepting states (iii) Transitions on \varepsilon (iv) None of the above20242mFORMAL LANGUAGE & AUTOMATA THEORYConstruct NFA for the regular expression: (0+1)^*00(0+1)^*20237m
PreviousCheck whether the grammar is ambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAbNextProve the pumping lemma for regular languages.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.