Construct a PDA that accepts: L = \{ u a w b : u,w \in \{a,b\}^*,\; |u

Back to the 2021 paper

Module 2: Context-Free Languages (CFL) and PDA

20217m

Construct a PDA that accepts:

$L = \{ u a w b : u,w \in \{a,b\}^*,\; |u| = |w| \}$

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYConstruct a PDA accepting: L = \{ a^{2n}bc : n \ge 0 \}20217m FORMAL LANGUAGE & AUTOMATA THEORYDesign a PDA (empty stack and final state both) for L = \{ WW^r \mid W \in \{a,b\}^* \}.20237m FORMAL LANGUAGE & AUTOMATA THEORYConstruct a PDA for the language: L = \{ 0^m 1^n 0^k \mid k \ge 1, m \ge 1, m > n + 2 \}20247m Formal Language & Automata TheoryConstruct a PDA that accepts the language L = \{a^{2n}bc \mid n \ge 0\} by final state and empty stack.20217m

PreviousConstruct an NFA accepting strings over \{0,1,2\} beginning with 0, followed by an odd number of 1s, ending with any number of 2s.NextDesign a Turing Machine to compute n \bmod 2.

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.

Get on Google Play