in Theory of Computation edited by
347 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$.$
in Theory of Computation edited by
by
347 views

2 Comments

@Lakshman Patel RJIT

it'll be $|x|\neq |y|$

0
0

@aditi19

No, the question is right, check into the book.

 

0
0

1 Answer

0 votes
0 votes

L=x#y | $x,y\epsilon(0,1),$ |x|=|y|

 

Related questions