@article{KYB_1969_5_4_a0,
author = {Rovan, Branislav},
title = {Bounded push down automata},
journal = {Kybernetika},
pages = {261--265},
year = {1969},
volume = {5},
number = {4},
mrnumber = {0247961},
zbl = {0184.28501},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1969_5_4_a0/}
}
Rovan, Branislav. Bounded push down automata. Kybernetika, Tome 5 (1969) no. 4, pp. 261-265. http://geodesic.mathdoc.fr/item/KYB_1969_5_4_a0/
[1] S. C. Kleene: Reprezentation of events in nerve sets. Automata Studies, Princeton University Press, Princeton 1956. | MR
[2] A. L. Rosenberg: A machine realization of the linear context-free languages. Information and Control X (1967), 2, 175-188. | Zbl
[3] N. Chomsky: Context-free grammars and push down storage. Quarterly Progress Report No. 65, Research Laboratory of Electronics, Massachusetts Institute of Technology, 1962.
[4] 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.
[5] S. Y. Kuroda: Classes of languages and linear-bound automata. Information and Control VII (1964), 3, 360-365. | MR
[6] S. Ginsburg E. H. Spanier: Bounded ALGOL-like languages. Trans. Am. Math. Soc. 113 (1964), 2, 333-368. | MR
[7] S. Ginsburg: The mathematical theory of context-free languages. McGraw-Hill, 1966. | MR | Zbl