Back to the 2023 paper
Similar questions
Formal Language & Automata TheoryDesign a Turing machine to perform 2's compliment operation on binary string.20197mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing Machine that increments a binary number by 1.20247mFormal Language & Automata TheoryDefine Turing machine. Design a Turing machine M to recognize the language \{ 1^n 2^n 3^n / n \ge 1 \}.20227mCompiler DesignConstruct a DFA over \{0, 1\} that accepts all strings containing an even number of 0s and an odd number of 1s. Verify the constructed DFA using suitable accepted and rejected input strings.20267m
PreviousProve that if L_1 and L_2 are regular, then L_1 \cup L_2 is regular.NextGiven 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} |
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.