The Gateway to Computer Science Excellence
0 votes
15 views
Let $L$ be a language.Define $\text{half(L)}$ to be the set of first halves of strings in $L,$ that is,$\{w|\text{for some x such that |x|=|w|,we have wx in L}\}.$For example,if $L=\{\in,0010,011,010110\}$ then $\text{half(L)}=\{\in,0,010\}.$ Notice that odd-length strings do not contribute to $\text{half(L)}$Prove that if $L$ is a regular language,so is $\text{half(L)}.$
in Theory of Computation by Veteran (54.9k points) | 15 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,645 questions
56,542 answers
195,692 comments
101,532 users