Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2001: Developments in Language Theory pp 228–238Cite as

Hierarchies of String Languages Generated by Deterministic Tree Transducers

  • Conference paper
  • First Online:

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

Abstract

The composition of total deterministic macro tree transducers gives rise to a proper hierarchy with respect to the generated string languages (these are the languages obtained by taking the yields of the output trees). The same holds for attributed tree transducers, for controlled EDT0L systems, and for YIELD mappings (which shows properness of the IO-hierarchy).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Boasson, B. Courcelle, and M. Nivat. The rational index: a complexity measure for languages. SIAM Journal on Computing, 10(2):284–296, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  2. W. Damm. The IO-and OI-hierarchies. Theoret. Comput. Sci., 20:95–207, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Engelfriet. Three hierarchies of transducers. Math. Systems Theory, 15:95–125, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150–202, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Engelfriet and E.M. Schmidt. IO and OI, Part II. J. of Comp. Syst. Sci., 16:67–99, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Engelfriet and H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71–146, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261–279, 1981.

    MATH  Google Scholar 

  9. Z. Fülöp and H. Vogler. Syntax-Directed Semantics-Formal Models based on Tree Transducers. EATCS Monographs on Theoretical Computer Science (W. Brauer, G. Rozenberg, A. Salomaa, eds.). Springer-Verlag, 1998.

    Google Scholar 

  10. S.A. Greibach. Formal languages: origins and directions. Ann. of the Hist. of Comput., 3(1):14–41, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  11. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

  12. S. Maneth. String languages generated by total deterministic macro tree transducers. In W. Thomas, editor, Proc. FOSSACS’99, volume 1578 of LNCS, pages 258–272. Springer-Verlag, 1999.

    Google Scholar 

  13. W.C. Rounds. Mappings and grammars on trees. Math. Systems Theory, 4:257–287, 1970.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIACS, Leiden University, PO Box 9512, 2300, Leiden, RA, The Netherlands

    Joost Engelfriet & Sebastian Maneth

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Maneth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Engelfriet, J., Maneth, S. (2002). Hierarchies of String Languages Generated by Deterministic Tree Transducers. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation