Prove regularity using DFA approach

Vote count:

0

Assume A is a regular language, prove that Ax={y|xy∈A} is regular also. I tried to think of generate the new start state by reading through the DFA(A). However, how to setup a formal DFA description(i.e. Q,Σ,δ,q0,F) for the new DFA for Ax? Kinda lost here.

asked 1 min ago

DCX

1

Prove regularity using DFA approach