Construct a regular grammar G generating the regular set represented by – P = a*b (a+b)*

Construct a regular grammar G generating the regular set represented by –

P = a*b (a+b)*

Ans.

        Pumping Lemma for regular language :

        Let,  M = (Q, Σ, ∂, q₀, F)  be a finite automation with n states.

        Let L be regular set accepted by M. Let  w ∈ L and |w| ≥ m.

        If m ≥ n, then there exists x, y, z such that w = xyz, z∈Σ and xyiz∈L for each i ≥ 0.