References
J. H. Bennett, “On Spectra”. Doctoral Dissertation, Princeton University, 1962.
N. Chomsky, On certain formal properties of grammars,Information and Control 2 (1959), 137–167.
N. Chomsky, “Context-free grammars and pushdown storage”. MIT Res. Lab. Electron. Quart. Prog. Rept. 65 (1962).
S. Ginsburg,The Mathematical Theory of Context Free Languages, McGraw-Hill, New York, 1966.
A. Grzegorczyk, Some Classes of Recursive Functions,Rozprawy Mat.,4 (1953).
N. Jones, Formal Languages and Rudimentary Attributes. Doctoral Dissertation, University of Western Ontario, 1967.
S. Y. Kuroda, Classes of languages and linear-bounded automata,Information and Control 7 (1964), 207–223.
P. S. Landweber, Three theorems on phrase structure grammars of type 1,Information and Control 6 (1963), 131–136.
J. Myhill, Linear bounded automata, Wright Air Dev. Command Tech. Rept. 57-624, 1957, pp. 112–237.
M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.
R. Smullyan,Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jones, N.D. Context-free languages and rudimentary attributes. Math. Systems Theory 3, 102–109 (1969). https://doi.org/10.1007/BF01746515
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01746515