Previous |  Up |  Next

Article

Title: Bounded push down automata (English)
Title: Ohraničené zásobníkové automaty (Slovak)
Author: Rovan, Branislav
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 5
Issue: 4
Year: 1969
Pages: (261)-265
Summary lang: Slovak
.
Category: math
.
MSC: 94.50
idZBL: Zbl 0184.28501
idMR: MR0247961
.
Date available: 2009-09-24T16:03:26Z
Last updated: 2012-06-04
Stable URL: http://hdl.handle.net/10338.dmlcz/124611
.
Reference: [1] S. C. Kleene: Reprezentation of events in nerve sets.Automata Studies, Princeton University Press, Princeton 1956. MR 0077478
Reference: [2] A. L. Rosenberg: A machine realization of the linear context-free languages.Information and Control X (1967), 2, 175-188. Zbl 0149.24804
Reference: [3] N. Chomsky: Context-free grammars and push down storage.Quarterly Progress Report No. 65, Research Laboratory of Electronics, Massachusetts Institute of Technology, 1962.
Reference: [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.
Reference: [5] S. Y. Kuroda: Classes of languages and linear-bound automata.Information and Control VII (1964), 3, 360-365. MR 0169724
Reference: [6] S. Ginsburg E. H. Spanier: Bounded ALGOL-like languages.Trans. Am. Math. Soc. 113 (1964), 2, 333-368. MR 0181500
Reference: [7] S. Ginsburg: The mathematical theory of context-free languages.McGraw-Hill, 1966. Zbl 0184.28401, MR 0211815
.

Files

Files Size Format View
Kybernetika_05-1969-4_1.pdf 375.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo