Mathematical systems theory

, Volume 3, Issue 2, pp 102–109 | Cite as

Context-free languages and rudimentary attributes

  • Neil D. Jones


Computational Mathematic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. H. Bennett, “On Spectra”. Doctoral Dissertation, Princeton University, 1962.Google Scholar
  2. [2]
    N. Chomsky, On certain formal properties of grammars,Information and Control 2 (1959), 137–167.Google Scholar
  3. [3]
    N. Chomsky, “Context-free grammars and pushdown storage”. MIT Res. Lab. Electron. Quart. Prog. Rept. 65 (1962).Google Scholar
  4. [4]
    S. Ginsburg,The Mathematical Theory of Context Free Languages, McGraw-Hill, New York, 1966.Google Scholar
  5. [5]
    A. Grzegorczyk, Some Classes of Recursive Functions,Rozprawy Mat.,4 (1953).Google Scholar
  6. [6]
    N. Jones, Formal Languages and Rudimentary Attributes. Doctoral Dissertation, University of Western Ontario, 1967.Google Scholar
  7. [7]
    S. Y. Kuroda, Classes of languages and linear-bounded automata,Information and Control 7 (1964), 207–223.Google Scholar
  8. [8]
    P. S. Landweber, Three theorems on phrase structure grammars of type 1,Information and Control 6 (1963), 131–136.Google Scholar
  9. [9]
    J. Myhill, Linear bounded automata, Wright Air Dev. Command Tech. Rept. 57-624, 1957, pp. 112–237.Google Scholar
  10. [10]
    M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.Google Scholar
  11. [11]
    R. Smullyan,Theory of Formal Systems, Annals of Mathematics Studies, No. 47, Princeton University Press, 1961.Google Scholar

Copyright information

© Swets & Zeitlinger B.V. 1969

Authors and Affiliations

  • Neil D. Jones
    • 1
  1. 1.The Pennsylvania State UniversityUSA

Personalised recommendations