in Theory of Computation retagged by
260 views
0 votes
0 votes
If $A$ is any language,let $A_{\frac{1}{2}-}$ be the set of all first halves of strings  in $A$ so that $A_{\frac{1}{2}-}=\{\text{x|for some y,|x|=|y| and xy $\in$ A\}}.$ Show that if $A$ is regular,then so is $A_{\frac{1}{2}-}.$
in Theory of Computation retagged by
by
260 views

Please log in or register to answer this question.

Related questions