×

The undecidability of a word problem: On a conjecture of Strong, Maggiolo-Schettini and Rosen. (English) Zbl 0457.03036


MSC:

03D03 Thue and Post systems, etc.
03D40 Word problems, etc. in computability and recursion theory
68N01 General topics in the theory of software

Citations:

Zbl 0311.68030
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] R. Book, M. Jantzen and C. Wrathall, Monadic Thue systems, submitted.; R. Book, M. Jantzen and C. Wrathall, Monadic Thue systems, submitted. · Zbl 0488.03020
[2] Ehrenfeucht, A.; Rozenberg, G., On the emptiness of the intersection of two DOS languages problem, Information Processing Lett., 10, 4/5, 223-225 (1980) · Zbl 0467.68069
[3] Strong, H.; Maggiolo-Schettini, A.; Rosen, B., Recursion structure simplification, SIAM J. Comput., 4, 307-320 (1975) · Zbl 0311.68030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.