MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS

DOI10.1142/S0218196709005317zbMath1201.20054OpenAlexW2126749247MaRDI QIDQ3643582

Alan J. Cain

Publication date: 9 November 2009

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196709005317

zbMATH Keywords

submonoidsstring rewriting systemsautomatic monoidsmonadic systemsconfluent systems

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Related Items (2)

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}\) ⋮ Hyperbolicity of monoids presented by confluent monadic rewriting systems.

Cites Work

• Unnamed Item
• Regular four-spiral semigroups, idempotent-generated semigroups and the Rees construction
• Corrections to: Inertia theory
• The fundamental four-spiral semigroup
• Notions of automaticity in semigroups.
• Automatic semigroups
• Properties of the subsemigroups of the bicyclic monoid
• SUBSEMIGROUPS OF THE BICYCLIC MONOID
• Automatic monoids and change of generators

This page was built for publication: MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS