The Gateway to Computer Science Excellence
0 votes
21 views
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 by Veteran (52.8k points) | 21 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,131 answers
193,669 comments
93,303 users