Back to the 2019 paper
Similar questions
Formal Language & Automata TheoryConstruct a push-down automata that accepts the following language: L = \{uawb : u \text{ and } w \in \{a, b\}^* \text{ and } |u| = |w|\}20217mCompiler DesignConstruct a transition diagram for the Pushdown Automaton for the language: L = \{ wcw^R \mid w \in \{a, b\}^* \}20267mFormal Language & Automata TheoryDesign a push-down automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.20197mFormal Language & Automata TheoryDesign a pushdown automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.20207m
PreviousConvert the following context-free grammar into GNF: S \to XY X \to YS \mid b Y \to SX \mid aNextUsing 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.
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.