Back to the 2023 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYThe string 1101 does not belong to the set represented by: (i) 1^* 0^* (0+1) (ii) 1(0+1)^*101 (iii) (1(0)^*(0+1)^*(0+1))^* (iv) \{00 + (11)^*0\}^*20232mFORMAL LANGUAGE & AUTOMATA THEORYGiven the regular expression: (0+1)^*01(0+1) Describe the language generated, and construct an equivalent DFA.20257mFORMAL LANGUAGE & AUTOMATA THEORYConstruct NFA for the regular expression: (0+1)^*00(0+1)^*20237mFORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for the regular expression: 1^*(10)^*20217m
PreviousConstruct NPDA for the grammar: S \to \alpha ABB \mid \alpha AA \\ A \to \alpha BB \mid \alpha \\ B \to bBB \mid ANextConstruct a Moore machine equivalent to the given Mealy machine.
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.