Given a regular language L on the input alphabet Σ, and X a subset of Σ*, show that the language {$w$:$w$ $\epsilon$ L, there is a x $\epsilon$ X so that $wx$ $\epsilon$ L} is also regular. Could you help me showing this, because I got stuck..
2026-04-01 10:21:41.1775038901
Show that the language is regular
59 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
HINT: Let $M$ be a DFA for $L$. $M'$, will be a DFA for the new language. It will be exactly the same as $M$ except for its set of acceptor states. A state $q$ should be an acceptor state in $M'$ if and only if it has an $x$-transition for some $x\in X$ to a state that is ... ?
When I say that $M$ and $M'$ have an $x$-transition from a state $q$ to a state $q'$, I mean that that if the machine is in state $q$ and reads the input word $x$, it ends up in state $q'$. If you’re familiar with the extended transition function $\delta^*$, I mean that $\delta^*(q,x)=q'$.