in Theory of Computation edited by
232 views
1 vote
1 vote

Let $G_{1}$ be the following grammar that we introduced in Example $2.45$. Use the DK-test to show that $G_{1}$ is not a DCFG.

  • $R \rightarrow S \mid T$
  • $S \rightarrow aSb \mid ab$
  • $T \rightarrow aTbb \mid abb$
in Theory of Computation edited by
by
232 views

1 comment

what is DK test here?
0
0

Please log in or register to answer this question.

Related questions