Bounded push down automata
Kybernetika (1969)
- Volume: 05, Issue: 4, page (261)-265
- ISSN: 0023-5954
Access Full Article
topHow to cite
topRovan, Branislav. "Bounded push down automata." Kybernetika 05.4 (1969): (261)-265. <http://eudml.org/doc/27766>.
@article{Rovan1969,
author = {Rovan, Branislav},
journal = {Kybernetika},
keywords = {languages, automata, networks},
language = {eng},
number = {4},
pages = {(261)-265},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Bounded push down automata},
url = {http://eudml.org/doc/27766},
volume = {05},
year = {1969},
}
TY - JOUR
AU - Rovan, Branislav
TI - Bounded push down automata
JO - Kybernetika
PY - 1969
PB - Institute of Information Theory and Automation AS CR
VL - 05
IS - 4
SP - (261)
EP - 265
LA - eng
KW - languages, automata, networks
UR - http://eudml.org/doc/27766
ER -
References
top- S. C. Kleene, Reprezentation of events in nerve sets, Automata Studies, Princeton University Press, Princeton 1956. (1956) MR0077478
- A. L. Rosenberg, A machine realization of the linear context-free languages, Information and Control X (1967), 2, 175-188. (1967) Zbl0149.24804
- N. Chomsky, Context-free grammars and push down storage, Quarterly Progress Report No. 65, Research Laboratory of Electronics, Massachusetts Institute of Technology, 1962. (1962)
- R. J. Evey, The theory of applications of push down store machines, Mathematical Linguistics and Automatic Translation, Harvard Univ. Computation Lab. Report NSF-10, May, 1963. (1963)
- S. Y. Kuroda, Classes of languages and linear-bound automata, Information and Control VII (1964), 3, 360-365. (1964) MR0169724
- S. Ginsburg E. H. Spanier, Bounded ALGOL-like languages, Trans. Am. Math. Soc. 113 (1964), 2, 333-368. (1964) MR0181500
- S. Ginsburg, The mathematical theory of context-free languages, McGraw-Hill, 1966. (1966) Zbl0184.28401MR0211815
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.