The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
22 views

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$.$
in Theory of Computation by Boss (45.8k points)
edited by | 22 views

1 Answer

0 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
by Active (4.1k points)

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
49,823 questions
54,818 answers
189,571 comments
81,046 users