Home /
Expert Answers /
Computer Science /
theory-of-computation-question-2-convert-the-following-right-linear-grammar-into-an-equivalent-nfa-pa820
(Solved): theory of computation QUESTION 2: Convert the following right linear grammar into an equivalent NFA. ...
theory of computation
QUESTION 2: Convert the following right linear grammar into an equivalent NFA. \[ \begin{array}{l} S \rightarrow a b A \mid a \\ A \rightarrow a A|b A| B \\ B \rightarrow a a b C \mid b b a \\ C \rightarrow \Lambda \end{array} \]
Expert Answer
Here is an NFA for the given right linear grammar: [asy] size(8cm); node[state] S,A,B,C; S -> A [label=a] S -> A [label=b] A -> A [label=a] A -> A [la