String-rewriting systems
A finiteness condition for rewriting systems
Theoretical Computer Science
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
Journal of Symbolic Computation
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Theoretical Computer Science
Word Processing in Groups
Automatic Monoids Versus Monoids with Finite Convergent Presentations
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
New Undecidablility Results for Finitely Presented Monoids
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Undecidable properties of monoids with word problem solvable in linear time
Theoretical Computer Science
String rewriting and homology of monoids
Mathematical Structures in Computer Science
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hi-index | 5.23 |
Using a particular simulation of single-tape Turing machines by finite string-rewriting systems the first two authors have shown that all linear Markov properties are undecidable for the class of finitely presented monoids with linear-time decidable word problem. Expanding on this construction it is shown here that also many properties that are not known to be linear Markov properties are undecidable for this class of monoids. These properties include the existence of context-free or regular cross-sections, the existence of finite convergent presentations, the property of being automatic, and the homological and homotopical finiteness properties left- and right-FPn (n ≥ 3), FHT, and FDT.