On a classification of context-free languages
Kybernetika (1967)
- Volume: 03, Issue: 1, page (22)-29
- ISSN: 0023-5954
Access Full Article
top
How to cite
topGruska, Jozef. "On a classification of context-free languages." Kybernetika 03.1 (1967): (22)-29. <http://eudml.org/doc/28685>.
@article{Gruska1967,
author = {Gruska, Jozef},
journal = {Kybernetika},
keywords = {mathematical logic},
language = {eng},
number = {1},
pages = {(22)-29},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On a classification of context-free languages},
url = {http://eudml.org/doc/28685},
volume = {03},
year = {1967},
}
TY - JOUR
AU - Gruska, Jozef
TI - On a classification of context-free languages
JO - Kybernetika
PY - 1967
PB - Institute of Information Theory and Automation AS CR
VL - 03
IS - 1
SP - (22)
EP - 29
LA - eng
KW - mathematical logic
UR - http://eudml.org/doc/28685
ER -
References
top- N. Chomsky, Formal Properties of Grammars, Handbook of Mathematical Psychology Vol. 2. Willey, New York, 1963. (1963) Zbl0156.25303
- K. Čulík, On equivalent and similar grammars of ALGOL-like languages, Comm. Math. Univ. Carol. 5 (1964), 57-59. (1964) MR0167351
- S. Ginsburg H. G. Rice, Two Families of Languages Related to ALGOL, JACM 9 (1962), 350-371. (1962) MR0152158
- J. Gruska, On sets generated by context-free grammars, Kybernetika 2 (1966), 6, 483 - 493. (1966) Zbl0158.25308MR0209091
Citations in EuDML Documents
top- Miroslav Novotný, Contextual grammars vs. context-free algebras
- Jürgen Dassow, Gheorghe Păun, Further remarks on the complexity of regulated rewriting
- Gheorghe Păun, On the syntactic complexity of parallel communicating grammar systems
- Jozef Gruska, On the size of context-free grammars
- Jan Ostravský, Acceptors and generalized -grammars
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.