Context-free controlled etol systems

  • Klaus -Jörn Lange
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 154)

Abstract

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

  • (CF)ETOL=(D2)ETOL=(DCF)ETOL

  • (RMOL)EDTOL ⊂LOG(CF)

  • EOL ⪵ (CF)EDTOL

  • OI ∩ IO ⪵ (CF)ETOL

Keywords

Control Word Membership Problem Tree Transducer Attribute Grammar Formal Language Theory 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ¦(A 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. ¦(A 2)¦.
    P.R.J. Asveld, Iterated Context-Independent Rewriting, Ph.D. thesis, Technische Hogeschool Twente, 1978.Google Scholar
  3. ¦(A 3)¦.
    P.R.J. Asveld, Space-bounded complexity classes and iterated deterministic substitution. Inform. and Control 44 (1980), 282–299.Google Scholar
  4. ¦(A E)¦.
    P.R.J. Asveld and J. Engelfriet, Iterated deterministic substitution, Acta Informatica 8 (1977), 285–302. in (A 2).Google Scholar
  5. ¦(C)¦.
    S.A. Cook, Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach. 18 (1971), 4–18.Google Scholar
  6. ¦(Cu O)¦.
    K. Culik II and J. Opatrny, Macro OL-systems, Internat. J. of Comput. Math. 4 (1975), 327–342.Google Scholar
  7. ¦(Eh R 1)¦.
    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. ¦(Eh R 2)¦.
    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. ¦(E)¦.
    J. Engelfriet, The complexity of languages generated by attribute grammars. Technical Report, Memorandumnr. INF-82-13, Twente University of Technology, 1982.Google Scholar
  10. ¦(E R S1)¦.
    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. ¦(E Sch vL)¦.
    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. ¦(E Sk)¦.
    J. Engelfriet and S. Skyum, Copying theorems, Inform. Process. Lett. 4 (1976), 157–161.Google Scholar
  13. ¦(G E)¦.
    S. Ginsburg and G. Rozenberg, TOL schemes and control sets, Inform. and Control 27 (1974), 109–125.Google Scholar
  14. ¦(H U)¦.
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Reading, 1979.Google Scholar
  15. ¦(L)¦.
    K.-J. Lange, Kontextfrei Kontrollierte ETOL-Systerne. Dissertation, Universität Hamburg, 1983.Google Scholar
  16. ¦(P)¦.
    C.R. Perrault, Intercalation lemmas for tree transducer languages, J. Comput. Syste. Sci 13 (1976), 246–277.Google Scholar
  17. ¦(R)¦.
    G. Rozenberg, Extension of tabled OL systems and languages, Internat. J. Comput. Inform. Sci. 2 (1973), 311–334.Google Scholar
  18. ¦(R S)¦.
    G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.Google Scholar
  19. ¦(S 1)¦.
    A. Salomaa, Formal Languages, Academic Press, New York, 1973.Google Scholar
  20. ¦(S 2)¦.
    A. Salomaa, Iteration grammars and Lindenmayer AFL's, Lecture Notes in Computer Science 15 (1974), 250–253.Google Scholar
  21. ¦(Su 1)¦.
    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. ¦(Su 2)¦.
    I.H. Sudborough, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25 (1978), 405–414.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Klaus -Jörn Lange
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgHamburg 13West Germany

Personalised recommendations