edited by
351 views
0 votes
0 votes
Let $C = \{x\#y \mid x, y\in\{0,1\}^{*}$ and $x\neq y\}.$ Show that $C$ is a context-free language$.$
edited by

1 Answer

Related questions

0 votes
0 votes
1 answer
1
admin asked May 4, 2019
264 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$.$
0 votes
0 votes
1 answer
4