edited by
455 views
0 votes
0 votes

Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$

  • $S\rightarrow TT\mid U$
  • $T\rightarrow 0T\mid T0\mid \#$
  • $U\rightarrow 0U00\mid\#$                          
  1. Describe $L(G)$ in English.
  2. Prove that $L(G)$ is not regular$.$
edited by

1 Answer

1 votes
1 votes
L={$0^n$#$(00)^n | n>0$} $\cup$ {0*#0*#0*}

one of the languages us DCFL and another is regular

DCFL $\cup$ regular is not regular

Related questions

0 votes
0 votes
1 answer
1
admin asked May 4, 2019
349 views
Let $C = \{x\#y \mid x, y\in\{0,1\}^{*}$ and $x\neq y\}.$ Show that $C$ is a context-free language$.$
0 votes
0 votes
1 answer
2
admin asked May 4, 2019
263 views
Let $\Sigma = \{a,b\}.$ Give a $CFG$ generating the language of strings with twice as many $a’s$ as $b’s.$ Prove that your grammar is correct$.$