Easy multiplications. I. The realm of Kleene's theorem
Information and Computation
Recognizable languages in concurrency monoids
Theoretical Computer Science
Theoretical Computer Science
The Book of Traces
Word Processing in Groups
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
Garside monoids vs divisibility monoids
Mathematical Structures in Computer Science
| Hi-index | 5.23 |
Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to compute normal forms in quadratic time. In addition, we prove that every divisibility monoid is biautomatic.