Proof Please: Context Free Grammar

Printable View

April 28th 2011, 07:10 PM
extatic

Proof Please: Context Free Grammar

Find context-free grammar for the following languages (with $n\geqslant0$ , $m\geqslant0$ , $k\geqslant0$ ).

$(a) L = \{a^n b^m c^k : n + 2m = k\}$

What i got so far is:

$S \to aSc | A$
$A \to bAcc | \lambda$

$(b) L = \{a^n b^m c^k : n = m \or\ m $\not=$ k\}$

No idea

All times are GMT -8. The time now is 10:20 AM.

Copyright © 2005-2013 Math Help Forum. All rights reserved.

Copyright © 2005-2013 Math Help Forum. All rights reserved.