Context-free programmed grammars and ETOL systems

  • G. Rozenberg
  • D. Vermeir
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


The relationship between ETOL systems and context-free programmed grammars is investigated. The characterization of the class of ETOL languages, and its main subclasses (EOL, EDTOL, EDOL) in terms of various subclasses of the class of context-free programmed grammars is provided. Then an extension of the notion of an ETOL system is investigated. In this way a characterization of the class of context-free programmed languages is provided.


Formal Language Regular Language Context Free Grammar Type Star Chain Event 
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]
    A.Ehrenfeucht, G.Rozenberg and S.Skuym, A relationship between ETOL and EDTOL languages, to appear in Theoretical Computer Science.Google Scholar
  2. [2]
    G.T.Herman and G.Rozenberg, Developmental systems and Languages, North Holland Publ. Comp. 1975.Google Scholar
  3. [3]
    D. Rosenkrantz, Programmed grammars and classes of formal languages, J.Assoc. Comput. Mach., 16,107–131,1969.Google Scholar
  4. [4]
    G. Rozenberg, Extension of tabled OL systems and languages, Int.J.Comp.Inf. Sciences, 2,311–334,1973.CrossRefGoogle Scholar
  5. [5]
    G.Rozenberg, A.Salomaa (eds.), L systems, Springer Verlag, 1974.Google Scholar
  6. [6]
    G.Rozenberg, A.Salomaa, Mathematical theory of L systems, to appear in Progress in Information Processing, J.Ton (ed.).Google Scholar
  7. [7]
    A.Salomaa, Formal Languages, Academic Press, 1975.Google Scholar
  8. [8]
    A.Salomaa, Parallelism in rewriting systems, Lecture Notes in Computer Science No. 14, 523–533, Springer Verlag, 1974.Google Scholar
  9. [9]
    S.Skyum, On decomposing languages defined by parallel devices, to appear in SIAM Journal on Computing.Google Scholar
  10. [10]
    J.van Leeuwen, The membership question for ETOL languages is polynomially complete, Inf. Proceeding Letters, 3,138–143.Google Scholar
  11. [11]
    M. Yoeli, Canonical representations of chain events, Information and Control, 8,180–189,1965.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • G. Rozenberg
    • 1
  • D. Vermeir
    • 2
  1. 1.Department of MathematicsUniversity of Antwerp,UIAWilrijkBelgium
  2. 2.Department of Applied EconomicsUniversity of Leuven,KULLeuvenBelgium

Personalised recommendations