THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS

From MaRDI portal
Publication:4786249

DOI10.1142/S0218196700000108zbMath1029.20028OpenAlexW2049964808MaRDI QIDQ4786249

Andrea Sattler-Klein, Friedrich Otto

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196700000108




Related Items (2)



Cites Work


This page was built for publication: THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS