Adherences of languages. (English) Zbl 0471.68052


68Q45 Formal languages and automata
Full Text: DOI


[1] Arnold, A.; Nivat, M., Non deterministic recursive programs, (Fundamentals of Computation Theory. Fundamentals of Computation Theory, Lecture Notes in Computer Science No. 56 (1977), Springer-Verlag: Springer-Verlag Heidelberg), 12-21 · Zbl 0361.68020
[2] Chomsky, N.; Schützenberger, M. P., The algebraic theory of context-free languages, Computer Programming and Formal Languages (1963) · Zbl 0148.00804
[3] Cohen, R.; Gold, A., Theory of ω-languages, I, II, J. Comput. System Sci., 15, 169-208 (1977) · Zbl 0363.68113
[4] Courcelle, B.; Nivat, M., Algebraic families of interpretations, (17th Symposium on Foundations of Computer Science. 17th Symposium on Foundations of Computer Science, Houston (1976)) · Zbl 0384.68016
[5] Dugundji, J., Topology (1976), Allyn & Bacon: Allyn & Bacon Boston
[6] Eilenberg, S., (Automata, Languages and machines, Vol. A (1974), Academic Press: Academic Press New York) · Zbl 0317.94045
[7] Linna, M., On ω-words and ω-computations, Ann. Univ. Turkuensis (1975) · Zbl 0319.68046
[8] Nivat, M., Mots infinis engendres par une grammaire algébrique, R.A.I.R.O. Inform. Théor., 11, 311-327 (1977) · Zbl 0371.68025
[9] Nivat, M., Sur les ensembles de mots infinis engendrés par une grammaire algébrique, R.A.I.R.O. Inform. Théor., 12, 259-278 (1978) · Zbl 0387.68050
[10] Schützenberger, M. P., Push-down automata and context-free languages, Inform. Contr., 6, 246-264 (1963) · Zbl 0123.12502
[11] Scott, D., Outline of a mathematical theory of computation (1972), Oxford Programming Research Group, Memo · Zbl 0419.68076
[12] Vuillemin, J., Syntaxe, sémantique et axiomatique d’un langage de programmation, (thése de Doctorat (1974), Université Paris VII) · Zbl 0327.68006
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.