Extensions and submonoids of automatic monoids.

DOI10.1016/S0304-3975(01)00390-5zbMath1061.20048OpenAlexW2088663140MaRDI QIDQ1853554

Benjamin Steinberg, Pedro V. Silva

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00390-5

zbMATH Keywords

presentationsfree productsideal extensionsautomatic monoidsright cancellative monoidsprefix automaticityRees matrix monoids

Mathematics Subject Classification ID

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

Related Items (8)

Automatic semigroups and categories. ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ A geometric characterization of automatic semigroups ⋮ A note on automatic semigroups. ⋮ DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS ⋮ LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE ⋮ Automatic semigroup acts. ⋮ On graph products of automatic monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic groups and amalgams
• On quasiconvex subgroups of negatively curved groups
• Automatic semigroups
• Automatic completely-simple semigroups
• Automatic monoids and change of generators

This page was built for publication: Extensions and submonoids of automatic monoids.