Construct a PDA for the grammar: S \to 0BB B \to 0S \mid 1S \mid 0 Tes

Back to the 2024 paper

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

20247m

Construct a PDA for the grammar:

$S \to 0BB$
$B \to 0S \mid 1S \mid 0$

Test whether $0104$ is accepted by this PDA.

Similar questions

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: L = \{ u a w b : u,w \in \{a,b\}^*,\; |u| = |w| \}20217m 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 FORMAL LANGUAGE & AUTOMATA THEORYProve that if L is accepted by a PDA, then L can be generated by a CFG.20227m

PreviousExplain the various types of Turing Machines.NextCheck whether the grammar is ambiguous: S \to a \mid abSb \mid aAb A \to bS \mid aAAb

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