Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryConvert the following DFA to regular expression using the state elimination technique. | State/input | 0 | 1 | |---|---|---| | \to *p | s | p | | q | p | s | | r | r | q | | s | q | r |20227mFORMAL LANGUAGE & AUTOMATA THEORYConvert the following NFA to DFA. 20247mFORMAL 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 TheoryDesign a pushdown automata to accept the following language by empty stack: \{ 0^n 1^n / n \ge 1 \}.20227m
PreviousConvert the following DFA to regular expression using the state elimination technique. | State/input | 0 | 1 | |---|---|---| | \to *p | s | p | | q | p | s | | r | r | q | | s | q | r |NextWhen a CFG is called ambiguous? Show that S \to as / aSbS / \epsilon is ambiguous.
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.