Projects per year
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 language | English |
---|---|
Pages (from-to) | 285-295 |
Number of pages | 11 |
Journal | Quarterly Journal of Mathematics |
Volume | 57 |
DOIs | |
Publication status | Published - Sept 2006 |
Fingerprint
Dive into the research topics of 'Cancellativity is undecidable for automatic semigroups'. Together they form a unique fingerprint.Projects
- 1 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard