Descriptional complexity measures of context-free languages
Kybernetika, Tome 19 (1983) no. 3, pp. 237-247
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1983_19_3_a4,
author = {\v{C}ern\'y, Anton},
title = {Descriptional complexity measures of context-free languages},
journal = {Kybernetika},
pages = {237--247},
year = {1983},
volume = {19},
number = {3},
mrnumber = {716652},
zbl = {0535.68039},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1983_19_3_a4/}
}
Černý, Anton. Descriptional complexity measures of context-free languages. Kybernetika, Tome 19 (1983) no. 3, pp. 237-247. http://geodesic.mathdoc.fr/item/KYB_1983_19_3_a4/
[1] S. Ginsburg: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York 1966. | MR | Zbl
[2] J. Gruska: Some classifications of context-free languages. Information and Control 14 (1969), 2, 152-179. | MR | Zbl
[3] J. Gruska: Complexity and unambiguity of context-free grammars and languages. Information and Control 18 (1971), 5, 502-519. | MR | Zbl
[4] J. Gruska: Descriptional complexity of context-free languages. Proceedings MFCS' 73, High Tatras, 71-83. | MR
[5] A. Salomaa: Formal Languages. Academic Press, New York and London 1973. | MR | Zbl