The Gateway to Computer Science Excellence
0 votes
5 views

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 by Veteran (54.9k points) | 5 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,505 answers
195,555 comments
101,045 users