Article contents
Recognizable languages in divisibility monoids
Published online by Cambridge University Press: 09 January 2002
Abstract
We define the class of divisibility monoids that arise as quotients of the free monoid Σ* modulo certain equations of the form ab = cd. These form a much larger class than free partially commutative monoids, and we show, under certain assumptions, that the recognizable languages in these divisibility monoids coincide with c-rational languages. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to these monoids. We obtain Ochmański's theorem on recognizable languages in free partially commutative monoids as a consequence.
- Type
- Research Article
- Information
- Copyright
- 2001 Cambridge University Press
- 10
- Cited by