The equivalence problem for deterministic TOL-systems is undecidable. (English) Zbl 0267.68033


68Q45 Formal languages and automata
03D03 Thue and Post systems, etc.
Full Text: DOI


[1] Ginsburg, S., The mathematical theory of context free languages (1966), McGraw-Hill: McGraw-Hill New York · Zbl 0184.28401
[2] Hopcroft, J. E.; Ullman, J. D., Format languages and their relation to automata (1969), Addison-Wesley: Addison-Wesley Reading, Massachusetts · Zbl 0196.01701
[3] Lindenmayer, A., Mathematical models for cellular interactions in development, J. Theoret. Biol., 18, 280 (1968), Parts I and II
[4] Lindenmayer, A.; Rozenberg, G., Developmental systems and languages, Proc. ACM Symposium on Theory of Computing (1972) · Zbl 0353.68087
[5] Pest, E. L., A variant of a recursively unsolvable problem, Bull. Am. Math. Soc., 52, 264 (1946) · Zbl 0063.06329
[6] Rozenberg, G., T0L systems and languages, Information and Control (1972), to appear
[7] S. Greibach, private communication.; S. Greibach, private communication.
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.