Context-free grammar forms

  • Armin B. Cremers
  • Seymour Ginsburg
Thursday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Finite Subset Phrase Structure Grammar Form Matical Family Phrase Structure Grammar 
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.
    Chomsky, N., On certain formal properties of grammars, Infor. and Control 2 (1959) 137–167.CrossRefGoogle Scholar
  2. 2.
    Chomsky, N., M.P. Schutzenberger, The algebraic theory of context-free languages, in Computer Programming and Formal Systems, P. Braffort and D. Hirschberg (eds), 118–161, North-Holland Publishing Co., Amsterdam (1963).Google Scholar
  3. 3.
    Gabrielian, A., S. Ginsburg, Grammar schemata, to appear in the J.ACM.Google Scholar
  4. 4.
    Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).Google Scholar
  5. 5.
    Ginsburg, S., Algebraic and Automata-Theoretic Properties of Formal Languages, to be published by the North-Holland Publishing Co., Amsterdam.Google Scholar
  6. 6.
    Ginsburg, S., E.H. Spanier, Finite-Turn pushdown automata, SIAM J. on Cont. 4 (1966), 429–453.CrossRefGoogle Scholar
  7. 7.
    Ginsburg, S., E.H. Spanier, Derivation-bounded languages, J.CSS 5 (1968) 228–250.Google Scholar
  8. 8.
    Ginsburg, S, E.H. Spanier, private communication.Google Scholar
  9. 9.
    Greibach, S.A., Simple syntactic operators on full semi-AFL's, J.CSS 6 (1972) 30–76.Google Scholar
  10. 10.
    Greibach, S.A., J.E. Hopcroft, Independence of AFL operations, in Studies in Abstract Families of Languages, Memoirs of the Amer.Math.Soc. 87 (1969) 33–44.Google Scholar
  11. 11.
    Maurer, H., Theoretische Grundlagen der Programmiersprachen, Bibliographisches Institut, Mannheim (1969).Google Scholar
  12. 12.
    Nivat, M., Transductions des Languages de Chomsky, Ph.D. Thesis, Paris 1967.Google Scholar
  13. 13.
    Salomaa, A., On the index of context-free grammars and languages, Information and Control, 10 (1979) 474–477.Google Scholar
  14. 14.
    Stanley, R. J., Finite state representations of context-free langauges, MIT Research Laboratory Quarterly Progress Report, 76 (1965) 276–279.Google Scholar
  15. 15.
    Yntema, M. K., Inclusion relations among families of context-free languages, Information and Control, 10 (1967) 572–597.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Armin B. Cremers
    • 1
  • Seymour Ginsburg
    • 1
  1. 1.Computer Science ProgramUniversity of Southern CaliforniaLos AngelesU.S.A.

Personalised recommendations