in Theory of Computation edited by
373 views
1 vote
1 vote
Let $\Sigma=\{a,b\}.$ Given a language $L\underline\subset \Sigma^{\ast}$ and a word $w\in\Sigma^{\ast}$, define the languages:
$$Extend(L,w) :=\{xw\:|\:x\in L\}$$ $$Shrink(L,w) :=\{x\:|\:xw\in L\}$$Show that if $L$ is regular, both $Extend(L,w)$ and $Shrink(L,w)$ are regular.
in Theory of Computation edited by
373 views

1 Answer

1 vote
1 vote

Answer:

Related questions