One of the most classical problems of regular expression might be the reverse of a regular language. Most solutions are based on finite state machines, that is, constructing a FSM by reversing all the arrows, adding epsilon moves to original accept states, and transforming this NFA to DFA.

However, it seems messy once you try to write down all the detail such as defining “adding epsilon moves to accept states”. Say,

where is the accept states in the original one. Also we need reversing like the following,

$ \delta'(q, x) = \{ q : \exists p(\delta(p, x) = q)\}.$

As it is labelled by alphabets, it cannot be written as inverse image directly. It goes on to complete all the detail in this way. After completing the construction, it is the time to prove that it works. So, we may need to define strings as finite sequences, and give a mathematical definition of the “reverse” such as is a reverse of if where is the length of the string.

Then we are going to prove that if there is a string accepted by the original machine, then is accepted by the new one and the new one does not accept any new string other than the reverses of the old one. To be honest, it’s boring to solve a problem by an ad hoc method.

However, as we know the equivalence of FSM and regular expression, why don’t we do it over r.e. ? It just costs few lines to define a reversal by valid regular operations as follows.

for any and .

The only non-trivial thing we need to prove is the third clause, but it is very intuitive to prove it by structural induction (or initial algebra). Also, it is defined structurally and we can play the same trick to other constructions like the intersection of regular languages(?) (Sorry, I can’t make it.) The point is that we do not only solve a problem but also have a idiom to solve a series of problems in common!

By the way when I was an undergraduate, my teaching assistant gave me zero to this answer because he said that he didn’t see anyone doing this before and he didn’t understand why the structural induction works. Ridiculous!

p.s. I noticed that this way is used in *Introduction to Automata Theory, Languages, and Computation, *by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman.

### Like this:

Like Loading...

*Related*

δ'(q,x) = {q | ..} doesn’t look right to me — q appears on the LHS but gets quantified on the RHS. But like you said, it’s tedious and boring.

It’s interesting seeing you talking about regular language/expressions, while I happen to come upon some related work too. Do you know that Dr. Tyng-Ruey Chuang always wanted to figure out how to compute the intersection of two regular languages, represented as regular expressions, without having to convert them to finite automaton? He’d be very interested if you know how.

Sorry, I can’t make the intersection inductively defined …

Hmm.. have I misread it? Is δ’(q,x) either a singleton set {q} or empty set? But, arrgh, that’s not the point here anyway.

Arrgh! I really made a mistake here! δ’(q,x) equals the set of p where it reaches q from p via x. Thanks for pointing out.