Finite transducers for divisibility monoids

DOI10.1016/j.tcs.2006.06.019zbMath1100.68057arXivmath/0601328OpenAlexW2954435965MaRDI QIDQ2508976

Matthieu Picantin

Publication date: 20 October 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0601328

zbMATH Keywords

normal formtransducerautomatic monoiddivisibility monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (5)

Automaticity of one-relator semigroups with length less than or equal to three ⋮ Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) ⋮ Cyclic amalgams, HNN extensions, and Garside one-relator groups ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizable languages in concurrency monoids
• Easy multiplications. I: The realm of Kleene's theorem
• Automatic groups and amalgams
• Non-positively curved aspects of Artin groups of finite type
• Notions of automaticity in semigroups.
• Computing the average parallelism in trace monoids.
• Automatic semigroups
• Combinatorial problems of commutation and rearrangements
• Groupes de Garside
• Automatic Structures for Torus Link Groups
• Recognizable languages in divisibility monoids
• A Geometric Characterization of Automatic Monoids
• Garside monoids vs divisibility monoids
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: Finite transducers for divisibility monoids