Hostname: page-component-76dd75c94c-8c549 Total loading time: 0 Render date: 2024-04-30T07:24:41.286Z Has data issue: false hasContentIssue false

Recognizable languages in divisibility monoids

Published online by Cambridge University Press:  09 January 2002

MANFRED DROSTE
Affiliation:
Institut für Algebra, TU Dresden, D-01062 Dresden, Email: droste@math.tu-dresden.de, kuskeg@math.tu-dresden.de
DIETRICH KUSKE
Affiliation:
Institut für Algebra, TU Dresden, D-01062 Dresden, Email: droste@math.tu-dresden.de, kuskeg@math.tu-dresden.de

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
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)