THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
From MaRDI portal
(Redirected from Publication:4786249)
Recommendations
- FDT is undecidable for finitely presented monoids with solvable word problems
- New undecidability results for finitely presented monoids
- scientific article; zbMATH DE number 2080253
- 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.
Cites work
- A finiteness condition for rewriting systems
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Complete rewriting systems and homology of monoid algebras
- Confluent and Other Types of Thue Systems
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- Infinite regular Thue systems
- LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
- Termination for direct sums of left-linear complete term rewriting systems
- Word problems and a homological finiteness condition for monoids
Cited in
(5)- 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.
- FDT is undecidable for finitely presented monoids with solvable word problems
- Finite derivation type for Rees matrix semigroups
- scientific article; zbMATH DE number 2080253 (Why is no real title available?)
This page was built for publication: THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786249)
