in Theory of Computation edited by
306 views
0 votes
0 votes

Let $CFG$   $G$ be the following grammar$.$

  •  $S\rightarrow aSb \mid bY \mid Y a$
  • $Y\rightarrow bY \mid aY \mid \epsilon$

Give a simple description of $L(G)$ in English$.$ Use that description to give a $CFG$ for $\overline{L(G)},$ the complement of $L(G).$

in Theory of Computation edited by
by
306 views

1 comment

L(G)=$a^nxb^n$ | $x\epsilon (a|b)^+$
0
0

Please log in or register to answer this question.

Related questions