13 search results - page 3 / 3 » A Kleene Theorem for Forest Languages |
FCT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
LATIN
1992
Springer
13 years 9 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...
CAI
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...