Easy multiplications. I. The realm of Kleene's theorem
Information and Computation
Theoretical Computer Science
Recognizable closures and submonoids of free partially commutative monoids
Theoretical Computer Science
Defining conditional independence using collapses
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Recognizable languages in concurrency monoids
Theoretical Computer Science
Representation of computations in concurrent automata by dependence orders
Theoretical Computer Science
Partial commutation and traces
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
The Book of Traces
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On Recognizable Subsets of Free Partially Commutative Monoids
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Nondeterministic Automata with Concurrency Relations and Domains
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Garside monoids vs divisibility monoids
Mathematical Structures in Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
| Hi-index | 0.00 |
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.