Automaticity of one-relator semigroups with length less than or equal to three

DOI10.1007/s11786-017-0291-7zbMath1409.68178arXiv1702.03355OpenAlexW2595129657MaRDI QIDQ2364902

Yuqun Chen, Honglian Xie, Haibin Wu

Publication date: 25 July 2017

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

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

zbMATH Keywords

normal formregular languageGröbner-Shirshov basisautomatic semigroupone-relator semigroup

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
• Finiteness and Dehn functions of automatic monoids having directed fellow traveller property.
• Small cancellation theory and automatic groups
• A geometric characterization of automatic semigroups
• Automatic groups and amalgams
• The diamond lemma for ring theory
• Embeddings into simple associative algebras
• Notions of automaticity in semigroups.
• Automatic semigroups
• Automatic completely-simple semigroups
• Strongly geodesically automatic groups are hyperbolic
• Finite transducers for divisibility monoids
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Singular Artin Monoids of Finite Coxeter Type Are Automatic
• Automaticity and commutative semigroups
• A Geometric Characterization of Automatic Monoids
• Automatic monoids and change of generators
• Gröbner–Shirshov bases and their calculation
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
• Fundamentals of Computation Theory