in Theory of Computation
211 views
0 votes
0 votes
We defined the $CUT$ of language $A$ to be $CUT(A) = \{yxz| xyz \in A\}$. Show that the class of $CFLs$ is not closed under $CUT$.
in Theory of Computation
by
211 views

Please log in or register to answer this question.

Related questions