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$.$ Theory of Computation michael-sipser theory-of-computation context-free-grammar + – admin asked May 4, 2019 edited May 4, 2019 by Lakshman Bhaiya admin 351 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply aditi19 commented Aug 18, 2019 reply Follow Share @Lakshman Patel RJIT it'll be $|x|\neq |y|$ 0 votes 0 votes Lakshman Bhaiya commented Aug 18, 2019 reply Follow Share @aditi19 No, the question is right, check into the book. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L=x#y | $x,y\epsilon(0,1),$ |x|=|y| aditi19 answered Aug 18, 2019 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.