Automatic presentations and semigroup constructions

DOI10.1007/s00224-009-9216-4zbMath1204.68118OpenAlexW2107370167MaRDI QIDQ1959386

Alan J. Cain, Graham Oliver, Nikola Ruškuc, Richard M. Thomas

Publication date: 6 October 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10023/2148

zbMATH Keywords

Clifford semigroupautomatic presentationcompletely simple semigroupFA-presentablesemigroup construction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups (20M99)

Related Items

UNARY FA-PRESENTABLE SEMIGROUPS

Cites Work

• Axiomatising tree-interpretable structures
• Automatic presentations for semigroups.
• Automatic semigroups
• Finite presentations of infinite structures: Automata and interpretations
• Automatic completely-simple semigroups
• Reidemeister-Schreier type rewriting for semigroups
• Automatic semigroups and Bruck-Reilly extensions.
• Automatic Presentations for Cancellative Semigroups
• Generators and relations of Rees matrix semigroups
• AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic presentations and semigroup constructions