Question: IfA is a language over alphabet , define : Show that if A is regular, then so is undouble(A) Example: if A (e, 0, 11,0010,0101)

IfA is a language over alphabet , define : Show that if A is regular, then so is undouble(A) Example: if A (e, 0, 11,0010,0101) then undouble(A) -{e, 1,01) Hint: First consider a simpler version where I fix the "middle" state q, so: In the "real" version of the problem, the "middle state" is not fixed
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
