Undecidability Results for Monoids with Linear-Time Decidable Word Problems

Authors:
Masashi Katsura;Yuji Kobayashi;Friedrich Otto
Affiliations:
-;-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 4
Cited 0

String-rewriting systems

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
New Undecidablility Results for Finitely Presented Monoids

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a particularly adopted simulation of Turing machines by finite string-rewriting systems we show that all strong Markov properties are undecidable for the class Clin of finitely presented monoids with linear-time decidable word problems. Expanding on this construction it is then shown that also many other properties are undecidable for Clin, among them the property of having a context-free (or a regular) cross-section, the existence of a finite convergent presentation, and the homological and homotopical finiteness conditions left- and right-FPn (n ≥ 3), left- and right-FP∞, FDT and FHT.