2 search results - page 1 / 1 » Rational subsets of partially reversible monoids |
TCS
2008
13 years 4 months ago
2008
LATIN
1992
Springer
13 years 8 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...