Non-Context Grammar and Pushdown Automata
2.35. Let NFA be represented graphically as follows: Start A 1 B 0 C 1 D 1 1 1) Construct a linear grammar that must be equivalent to the above NFA . 2) Construct a left linear grammar equivalent to the above NFA . 3) Find the regular expression equivalent to the above NFA ...



