An explicit algorithm for normal forms in small overlap monoids

DOI10.1016/j.jalgebra.2023.04.019zbMath1517.20082arXiv2105.12125OpenAlexW3165295320MaRDI QIDQ6162859

James D. Mitchell, Maria Tsalakou

Publication date: 26 June 2023

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

semigroupnormal formsmonoidfinite presentationsmall cancellationsmall overlap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic complexity of finitely presented monoids and semigroups
• Small overlap monoids. I: The word problem.
• Small overlap monoids. II: Automatic structures and normal forms.
• Presentations of groups and monoids
• On-line construction of suffix trees
• A note on the definition of small overlap monoids.
• Algorithms on Strings, Trees and Sequences
• Recursive Unsolvability of a problem of Thue
• A practical method for enumerating cosets of a finite abstract group

This page was built for publication: An explicit algorithm for normal forms in small overlap monoids