Conference proceedings article
PDT is undecidable for finitely presented monoids with solvable word problems



Publication Details
Authors:
Otto, F.
Editor:
Chlebus, EB; Czaja, L
Publisher:
Springer
Place:
Berlin
Publication year:
1997
Pages range:
388-399
Book title:
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS;INFORMATION AND COMPUTATION
Volume number:
1279
Start page:
388
End page:
399
ISBN:
3-540-63386-3
ISSN:
0302-9743

Abstract
Exploiting a new technique for proving undecidability results developed by A. Sattler-Klein in her doctoral dissertation (1996) it is shown that it is undecidable in general whether or not a finitely presented monoid with a solvable word problem has finite derivation type (FDT). This improves upon the undecidability result of R. Cremanns and F. Otto (1996), which was based on the undecidability of the word problem for the finitely presented monoids considered.


Authors/Editors

Last updated on 2019-25-07 at 17:12