Tree controlled grammars. (English) Zbl 0363.68108


68Q45 Formal languages and automata
Full Text: DOI


[1] Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1974. · Zbl 0326.68005
[2] Culik, K., II, Opatrny, J.: Context in parallel rewriting. Lecture Notes in Computing Science: L Systems, No. 15, pp. 230–243. Berlin-Heidelberg-New York: Springer 1974. · Zbl 0315.68066
[3] Ginsburg, S.: The mathematical theory of context-free languages. New York: McGraw-Hill 1966. · Zbl 0184.28401
[4] Herman, G. T., Rozenberg, G.: Developmental systems and languages. Amsterdam: North Holland 1975. · Zbl 0306.68045
[5] Maurer, H. A.: Theoretische Grundlagen der Programmiersprachen – Theorie der Syntax. Mannheim: BI 1969. · Zbl 0204.31801
[6] Maurer, H. A.: A direct proof of the inherent ambiguity of a simple context-free language. J. ACM16, 256–260 (1969). · Zbl 0182.33401
[7] Salomaa, A.: Formal languages. London: Academic Press 1973. · Zbl 0262.68025
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.