Skip to main content
SpringerLink
Log in

Context-free controlled etol systems

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1983)

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

Included in the following conference series:

Abstract

The following results concerning context-free controlled ETOL systems are shown:

  • (CF)ETOL=(D 2)ETOL=(DCF)ETOL

  • (RMOL)EDTOL ⊂LOG(CF)

  • EOL ⪵ (CF)EDTOL

  • OI ∩ IO ⪵ (CF)ETOL

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. P.R.J. Asveld, Controlled iteration grammars and full hyper-AFL's, Inform, and Control 34 (1977), 248–269. in (A 2).

    Google Scholar 

  2. P.R.J. Asveld, Iterated Context-Independent Rewriting, Ph.D. thesis, Technische Hogeschool Twente, 1978.

    Google Scholar 

  3. P.R.J. Asveld, Space-bounded complexity classes and iterated deterministic substitution. Inform. and Control 44 (1980), 282–299.

    Google Scholar 

  4. P.R.J. Asveld and J. Engelfriet, Iterated deterministic substitution, Acta Informatica 8 (1977), 285–302. in (A 2).

    Google Scholar 

  5. S.A. Cook, Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach. 18 (1971), 4–18.

    Google Scholar 

  6. K. Culik II and J. Opatrny, Macro OL-systems, Internat. J. of Comput. Math. 4 (1975), 327–342.

    Google Scholar 

  7. A. Ehrenfeucht and G. Rozenberg, A pumping theorem for deterministic ETOL languages, Rev. Fr. Automat. Inform. Rech. Opér., Sér. Rouge 9 (1975), 13–23.

    Google Scholar 

  8. A. Ehrenfeucht and G. Rozenberg, On the structure of derivations in deterministic ETOL systems, J. Comput. System Sci. 17 (1978), 331–347.

    Google Scholar 

  9. J. Engelfriet, The complexity of languages generated by attribute grammars. Technical Report, Memorandumnr. INF-82-13, Twente University of Technology, 1982.

    Google Scholar 

  10. J. Engelfriet, G. Rozenberg, and G. Slutzki, Tree transducers, L-systems and two-way machines, J. Comput. System Sci. 20 (1980), 150–202.

    Google Scholar 

  11. J. Engelfriet, E.M. Schmidt, and J. van Leeuwen, Stack machines and classes of nonnested macro languages, J. Assoc. Comput. Mach. 27 (1980), 96–117.

    Google Scholar 

  12. J. Engelfriet and S. Skyum, Copying theorems, Inform. Process. Lett. 4 (1976), 157–161.

    Google Scholar 

  13. S. Ginsburg and G. Rozenberg, TOL schemes and control sets, Inform. and Control 27 (1974), 109–125.

    Google Scholar 

  14. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Reading, 1979.

    Google Scholar 

  15. K.-J. Lange, Kontextfrei Kontrollierte ETOL-Systerne. Dissertation, Universität Hamburg, 1983.

    Google Scholar 

  16. C.R. Perrault, Intercalation lemmas for tree transducer languages, J. Comput. Syste. Sci 13 (1976), 246–277.

    Google Scholar 

  17. G. Rozenberg, Extension of tabled OL systems and languages, Internat. J. Comput. Inform. Sci. 2 (1973), 311–334.

    Google Scholar 

  18. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.

    Google Scholar 

  19. A. Salomaa, Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

  20. A. Salomaa, Iteration grammars and Lindenmayer AFL's, Lecture Notes in Computer Science 15 (1974), 250–253.

    Google Scholar 

  21. I.H. Sudborough, The complexity of the membership problem for some extensions of context-free languages, Internat. J. Comput. Math. 6 (1977), 191–215.

    Google Scholar 

  22. I.H. Sudborough, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25 (1978), 405–414.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Schlüterstraße 70, 2000, Hamburg 13, West Germany

    Klaus -Jörn Lange

Authors
  1. Klaus -Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, K.J. (1983). Context-free controlled etol systems. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036951

Download citation

  • DOI: https://doi.org/10.1007/BFb0036951

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation