Previous |  Up |  Next

Article

References:
[1] J. Gruska: Descriptional complexity of context-free languages. Proc. of Symp. and Summer School Math. Found. of Computer Sci., High Tatras 1973. MR 0405938
[2] I. M. Havel: Finite branching automata. Kybernetika 10 (1974), 281 - 302. MR 0381383 | Zbl 0287.94050
[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 0338.68060
[4] S. Marcus: Gramatici şi automate finite. Ed. Academiei R.S.R., Bucureşti 1964. MR 0174411
[5] S. Marcus: Contextual grammars. Rev. Roum. Math. Pures et Appl. 10 (1969), 1525-1534. MR 0262026 | Zbl 0193.32401
[6] Gh. Păun: Asupra gramaticilor contextuale. Studii şi cercetări matematice 26 (1974), 1111-1129. MR 0368500
[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 0495259
[9] A. Salomaa: Formal languages. Academic Press, New York - London 1973. MR 0438755 | Zbl 0262.68025
Partner of
EuDML logo