@article{KYB_1978_14_6_a1,
author = {P\u{a}un, Gheorghe},
title = {Two infinite hierarchies of languages defined by branching grammars},
journal = {Kybernetika},
pages = {397--407},
year = {1978},
volume = {14},
number = {6},
mrnumber = {529192},
zbl = {0394.68052},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1978_14_6_a1/}
}
Păun, Gheorghe. Two infinite hierarchies of languages defined by branching grammars. Kybernetika, Tome 14 (1978) no. 6, pp. 397-407. http://geodesic.mathdoc.fr/item/KYB_1978_14_6_a1/
[1] J. Gruska: Descriptional complexity of context-free languages. Proc. of Symp. and Summer School Math. Found. of Computer Sci., High Tatras 1973. | MR
[2] I. M. Havel: Finite branching automata. Kybernetika 10 (1974), 281 - 302. | MR | Zbl
[3] I. M. Havel: On the branching structure of languages. Proc. of Symp. Math. Found. of Computer Sci., Gdansk 1976, Lecture Notes in Computer Science 45 (1976). | Zbl
[4] S. Marcus: Gramatici şi automate finite. Ed. Academiei R.S.R., Bucureşti 1964. | MR
[5] S. Marcus: Contextual grammars. Rev. Roum. Math. Pures et Appl. 10 (1969), 1525-1534. | MR | Zbl
[6] Gh. Păun: Asupra gramaticilor contextuale. Studii şi cercetări matematice 26 (1974), 1111-1129. | MR
[7] Gh. Păun: On a prolongation operation of languages. Bull. Math. de la Soc. de Sci. Math. de R.S.R. (in press).
[8] Gh. Păun: Contextual grammars with restrictions in derivation. Rev. Roum. Math. Pures et Appl. 22 (1977), 1147-1154. | MR
[9] A. Salomaa: Formal languages. Academic Press, New York - London 1973. | MR | Zbl