Back to the 2019 paper
Similar questions
Formal Language & Automata TheoryDesign a Turing machine (TM) to compute n \bmod 2.20217mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing machine that recognizes strings containing equal number of 0’s and 1’s.20237mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing Machine to compute n \bmod 2.20217mFORMAL LANGUAGE & AUTOMATA THEORYDesign a Turing Machine that increments a binary number by 1.20247m
PreviousUsing the following grammar S \to AB \mid BC A \to BA \mid a B \to CC \mid b C \to AB \mid a use the CYK algorithm to determine whether the given string baaba is in L(G) or not.NextWrite short notes on the following: (i) Deterministic PDA vs. non-deterministic PDA (ii) Universal Turing machine (iii) Non-deterministic Turing machine (iv) Post correspondence problem (PCP)
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.