Advertisement

Hierarchies of String Languages Generated by Deterministic Tree Transducers

  • Joost Engelfriet
  • Sebastian Maneth
Conference paper
Part of the Lecture Notes in Computer Science book series (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).

Keywords

Yield Mapping Hasse Diagram Tree Automaton Tree Language Rank Zero 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCN81]
    L. Boasson, B. Courcelle, and M. Nivat. The rational index: a complexity measure for languages. SIAM Journal on Computing, 10(2):284–296, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [Dam82]
    W. Damm. The IO-and OI-hierarchies. Theoret. Comput. Sci., 20:95–207, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [DE98]
    F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [Eng82]
    J. Engelfriet. Three hierarchies of transducers. Math. Systems Theory, 15:95–125, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [ERS80]
    J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150–202, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [ES78]
    J. Engelfriet and E.M. Schmidt. IO and OI, Part II. J. of Comp. Syst. Sci., 16:67–99, 1978.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [EV85]
    J. Engelfriet and H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71–146, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [Fül81]
    Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261–279, 1981.zbMATHGoogle Scholar
  9. [FV98]
    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. [Gre81]
    S.A. Greibach. Formal languages: origins and directions. Ann. of the Hist. of Comput., 3(1):14–41, 1981.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [GS84]
    F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.zbMATHGoogle Scholar
  12. [Man99]
    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. [Rou70]
    W.C. Rounds. Mappings and grammars on trees. Math. Systems Theory, 4:257–287, 1970.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • Sebastian Maneth
    • 1
  1. 1.LIACSLeiden UniversityLeidenThe Netherlands

Personalised recommendations