Question

This is a question from Computational Theory and Automata. This topic is not covered in my textbook so please go over all the steps that you would use to solve this problem. Thank you.

Create near arämmman oina regeprerian:

Answer 1

Left linear grammar:

in this string is derived from left to right, have to write the productions so that string can be derived only from left to right.

S--> 1S₁ | 0 S₂

  S₁--> X S₁ | 0

X--> 0 | 1

S₂--> 1 S₂ | epsilon.

Right linear grammar:

in this string is derived from right to Left, have to write the productions so that string can be derived only from right to Left.

S--> S₁ 0 | S₂   

     S₁--> S₁ X | 1

X-->0 | 1

S₂--> S₂ 1 | 0