CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS

DOI10.1093/QMATH/HAI023MaRDI QIDQ3429796zbMATH OpenOpenAlexFDO

Authors Alan J. Cain

Publication date 20 March 2007

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d89d4a5b81aca019181925de78f576d0cf44b52f

zbMATH Keywords

undecidabilityPost correspondence problemcancellative semigroupsstring rewriting systemsautomatic semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Automatic semigroups
• Notions of automaticity in semigroups.
• Uniform decision problems for automatic semigroups.
• Automaticity and commutative semigroups
• Automatic subsemigroups of free products.
• An automatic semigroup of languages
• Quasi-automatic semigroups
• A note on automatic semigroups.
• Automaton semigroups
• scientific article; zbMATH DE number 1839458

Cited in

(5)

• Decision problems for word-hyperbolic semigroups
• Automatic Rees matrix semigroups over categories.
• Automatic presentations for semigroups.
• Cancellativity in finitely presented semigroups
• Uniform decision problems for automatic semigroups.

This page was built for publication: CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429796)