Construct a CFG for: \{ 0^i 1^j 2^k \mid i + j \ge 2k \}

Back to the 2022 paper

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

20227m

Construct a CFG for:

$\{ 0^i 1^j 2^k \mid i + j \ge 2k \}$

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYConvert the CFG to GNF: S \to AB \mid BC \\ A \to aB \mid bA \mid a \\ B \to bB \mid cC \mid b \\ C \to c20227m FORMAL LANGUAGE & AUTOMATA THEORYConstruct an NFA accepting strings over \{0,1,2\} beginning with 0, followed by an odd number of 1s, ending with any number of 2s.20217m Compiler DesignConstruct a DFA for the regular expression r = 0^*1^*2^*.20257m Formal Language & Automata TheoryConstruct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by odd number of 1's and ending with any number of 2's.20217m

PreviousShow that the language of palindromes over \{a, b\} is not regular.NextConvert the CFG to GNF: S \to AB \mid BC \\ A \to aB \mid bA \mid a \\ B \to bB \mid cC \mid b \\ C \to c

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