Results 1 to 1 of 1

Thread: Proof Please: Context Free Grammar

  1. April 28th 2011, 07:10 PM #1
    extatic
    extatic is offline
    Junior Member
    Joined
    May 2010
    Posts
    26

    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
    Last edited by extatic; April 28th 2011 at 07:24 PM.
    Follow Math Help Forum on Facebook and Google+
« NFA to DFA | Proof check: Convert DFA into Regular Expression »

Similar Math Help Forum Discussions

  1. Context free grammar question.
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: April 25th 2011, 04:09 PM
  2. context-free grammar
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: March 27th 2011, 11:51 AM
  3. Context-free grammar
    Posted in the Discrete Math Forum
    Replies: 16
    Last Post: June 29th 2010, 09:41 AM
  4. context-free language and grammar
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: June 28th 2010, 04:42 PM
  5. context-free grammar
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: May 6th 2010, 09:26 PM

Search Tags


/mathhelpforum @mathhelpforum