Re: Question on language regularity

On Sep 1, 2:17 pm, d...@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner) wrote:
Can you come up with a regular transducer (a Mealy/Moore machine)
that produces a_2 a_1 a_4 a_3 ... a_(2n) a_(2n-1) as its output when
given a1 a2 a3 ... a_(2n) as its input?

Hmm, I don't think so. I am not sure how to define the output function
in that case.

Another attempt I made was trying to define a translation function on
the defining regular expression. That may maybe work...

If not, could first/follow-sets help maybe?

Eric

.