Context-free languages and rudimentary attributes. (English) Zbl 0179.02202

Full Text: DOI


[1] J. H. Bennett, ”On Spectra”. Doctoral Dissertation, Princeton University, 1962.
[2] N. Chomsky, On certain formal properties of grammars,Information and Control 2 (1959), 137–167. · Zbl 0088.10801 · doi:10.1016/S0019-9958(59)90362-6
[3] N. Chomsky, ”Context-free grammars and pushdown storage”. MIT Res. Lab. Electron. Quart. Prog. Rept. 65 (1962).
[4] S. Ginsburg,The Mathematical Theory of Context Free Languages, McGraw-Hill, New York, 1966. · Zbl 0184.28401
[5] A. Grzegorczyk, Some Classes of Recursive Functions,Rozprawy Mat.,4 (1953). · Zbl 0052.24902
[6] N. Jones, Formal Languages and Rudimentary Attributes. Doctoral Dissertation, University of Western Ontario, 1967.
[7] S. Y. Kuroda, Classes of languages and linear-bounded automata,Information and Control 7 (1964), 207–223. · Zbl 0199.04002 · doi:10.1016/S0019-9958(64)90120-2
[8] P. S. Landweber, Three theorems on phrase structure grammars of type 1,Information and Control 6 (1963), 131–136. · Zbl 0116.11702 · doi:10.1016/S0019-9958(63)90169-4
[9] J. Myhill, Linear bounded automata, Wright Air Dev. Command Tech. Rept. 57-624, 1957, pp. 112–237.
[10] M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125. · doi:10.1147/rd.32.0114
[11] R. Smullyan,Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961. · Zbl 0097.24503
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.