Results 1 to 3 of 3

Math Help - Regular Grammar

  1. #1
    Super Member
    Joined
    Jun 2008
    Posts
    829

    Regular Grammar

    Describe a regular grammar that generates the regular language of all strings in {0,1} that do not contain two consecutive 0's

    S->A
    A->0B | 1A | E
    B->1A | E

    E is empty

    Are correct ?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Correct. Another one:

    S -> A
    A -> 0 | 1A | 01A | E
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Super Member
    Joined
    Jun 2008
    Posts
    829
    Thank you
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: September 27th 2011, 03:42 PM
  2. Simplification grammar
    Posted in the Discrete Math Forum
    Replies: 17
    Last Post: June 30th 2010, 06:16 AM
  3. Context-free grammar
    Posted in the Discrete Math Forum
    Replies: 16
    Last Post: June 29th 2010, 10:41 AM
  4. Grammar problem
    Posted in the Discrete Math Forum
    Replies: 12
    Last Post: June 29th 2010, 06:42 AM
  5. Forming a language with Regular Grammar
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: January 26th 2010, 01:54 AM

Search Tags


/mathhelpforum @mathhelpforum