scientific article; zbMATH DE number 2080253
From MaRDI portal
Publication:4472500
zbMATH Open1044.03029MaRDI QIDQ4472500FDOQ4472500
Authors: Friedrich Otto, Masashi Katsura, Yuji Kobayashi 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690278.htm
Title of this publication is not available (Why is that?)
Recommendations
- 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.
- New undecidability results for finitely presented monoids
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
- FDT is undecidable for finitely presented monoids with solvable word problems
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Undecidability and degrees of sets of sentences (03D35)
Cited In (6)
- 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.
- Mathematical Foundations of Computer Science 2003
- Title not available (Why is that?)
- New undecidability results for finitely presented monoids
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472500)
