search
Log In
0 votes
22 views
Show that every DCFG generates a prefix-free language.
in Theory of Computation 22 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
3
76 views
Consider the following CFG $G:$ $S \rightarrow SS \mid T$ $T \rightarrow aT b \mid ab$ Describe $L(G)$ and show that $G$ is ambiguous. Give an unambiguous grammar $H$ where $L(H) = L(G)$ and sketch a proof that $H$ is unambiguous.
asked Oct 12, 2019 in Theory of Computation Lakshman Patel RJIT 76 views
1 vote
1 answer
4
...