Let sigma 0 1 lambda Create a regular grammar that generate

Let sigma = {0, 1, lambda}. Create a regular grammar that generates each of the following languages. a. L = {(01)^n | n Greaterthanorequalto 1} b. L = {001^n00 | n Greaterthanorequalto 2}

Solution

In theoretical computer science and formal language theory, a regular grammar is a formal grammar that is right-regular or left-regular. Every regular grammar describes a regular language.

A right regular grammar (also called right linear grammar) is a formal grammar (N, , P, S) such that all the production rules in P are of one of the following forms:

In a left regular grammar (also called left linear grammar), all rules obey the forms

A regular grammar is a left or right regular grammar.