Skip to main content
SpringerLink
Log in

Context-free programmed grammars and ETOL systems

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 45))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.Ehrenfeucht, G.Rozenberg and S.Skuym, A relationship between ETOL and EDTOL languages, to appear in Theoretical Computer Science.

    Google Scholar 

  2. G.T.Herman and G.Rozenberg, Developmental systems and Languages, North Holland Publ. Comp. 1975.

    Google Scholar 

  3. D. Rosenkrantz, Programmed grammars and classes of formal languages, J.Assoc. Comput. Mach., 16,107–131,1969.

    Google Scholar 

  4. G. Rozenberg, Extension of tabled OL systems and languages, Int.J.Comp.Inf. Sciences, 2,311–334,1973.

    Article  Google Scholar 

  5. G.Rozenberg, A.Salomaa (eds.), L systems, Springer Verlag, 1974.

    Google Scholar 

  6. G.Rozenberg, A.Salomaa, Mathematical theory of L systems, to appear in Progress in Information Processing, J.Ton (ed.).

    Google Scholar 

  7. A.Salomaa, Formal Languages, Academic Press, 1975.

    Google Scholar 

  8. A.Salomaa, Parallelism in rewriting systems, Lecture Notes in Computer Science No. 14, 523–533, Springer Verlag, 1974.

    Google Scholar 

  9. S.Skyum, On decomposing languages defined by parallel devices, to appear in SIAM Journal on Computing.

    Google Scholar 

  10. J.van Leeuwen, The membership question for ETOL languages is polynomially complete, Inf. Proceeding Letters, 3,138–143.

    Google Scholar 

  11. M. Yoeli, Canonical representations of chain events, Information and Control, 8,180–189,1965.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Antwerp,UIA, 2610, Wilrijk, Belgium

    G. Rozenberg

  2. Department of Applied Economics, University of Leuven,KUL, Leuven, Belgium

    D. Vermeir

Authors
  1. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Vermeir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozenberg, G., Vermeir, D. (1976). Context-free programmed grammars and ETOL systems. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_218

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_218

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation