Quasi-automatic semigroups

DOI10.1016/j.tcs.2019.01.002zbMath1454.20115arXiv1906.02842OpenAlexW2910592654MaRDI QIDQ2422022

Christian Choffrut, Benjamin Blanchette, Christophe Reutenauer

Publication date: 18 June 2019

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

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

zbMATH Keywords

automatic groupsrational relationsrational transductionsautomatic semigroups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Quasi-automatic groups are asynchronously automatic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric properties and asynchronously automatic semigroups.
• A geometric characterization of automatic semigroups
• Easy multiplications. II: Extensions of rational semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• Efficient recognition of rational relations
• Transductions des langages de Chomsky
• A new proof of two theorems about rational transductions
• Automatic semigroups
• Multitape one-way nonwriting automata
• Sets recognized by n-tape automata
• A Geometric Characterization of Automatic Monoids
• Automatic monoids and change of generators
• Strongly automatic semigroups
• On Relations Defined by Generalized Finite Automata

This page was built for publication: Quasi-automatic semigroups