Cancellativity is undecidable for automatic semigroups

Alan J. Cain

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Via an encoding of the Modified Post's Correspondence Problem, this paper shows that it is undecidable whether an automatic semigroup is cancellative.

Original languageEnglish
Pages (from-to)285-295
Number of pages11
JournalQuarterly Journal of Mathematics
Volume57
DOIs
Publication statusPublished - Sept 2006

Fingerprint

Dive into the research topics of 'Cancellativity is undecidable for automatic semigroups'. Together they form a unique fingerprint.

Cite this