New undecidability results for finitely presented monoids
From MaRDI portal
Publication:4594219
DOI10.1007/3-540-62950-5_62zbMath1379.20013OpenAlexW1511851241MaRDI QIDQ4594219
Publication date: 17 November 2017
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-62950-5_62
Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)
Related Items (3)
FDT is undecidable for finitely presented monoids with solvable word problems ⋮ Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. ⋮ Undecidable properties of monoids with word problem solvable in linear time.
This page was built for publication: New undecidability results for finitely presented monoids
