LATIN
1992
Springer
14 years 10 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...