Uniform decision problems for automatic semigroups.

DOI10.1016/j.jalgebra.2005.11.028zbMath1106.20042arXivmath/0509349MaRDI QIDQ2509285

Friedrich Otto, Mark Kambites

Publication date: 19 October 2006

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

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

zbMATH Keywords

algorithms; decision problems; automatic semigroups; Rees matrix representations

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M05: Free semigroups, generators and relations, word problems

68Q70: Algebraic theory of languages and automata

Related Items

Automatic presentations for semigroups.

Uses Software

• GAP

Cites Work

• When is an extension of a specification consistent? Decidable and undecidable cases
• Notions of automaticity in semigroups.
• Automatic semigroups
• Automatic completely-simple semigroups
• CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
• Generators and relations of Rees matrix semigroups
• Automaticity and commutative semigroups
• A Geometric Characterization of Automatic Monoids
• AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
• Automatic monoids and change of generators
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item