Skip to main content
SpringerLink
Log in

The Delta Operation: From Strings to Trees to Strings

  • Chapter
  • First Online:
Formal and Natural Computing

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

  • 310 Accesses

Abstract

The delta of a language L consists of the yields of trees of which all paths are in L. The context-free languages are the deltas of the regular languages. The indexed languages are the deltas of the deterministic context-free languages. In general, the nondeterministic (n+1)-iterated pushdown languages are the deltas of the deterministic n-iterated pushdown languages. The recursively enumerable languages are the deltas of the context-free languages. The delta of a string relation R consists of the yields of trees of which all paths are in the R-image of one string. The ET0L languages are the deltas of the relations recognized by deterministic two-tape finite automata. The recursively enumerable languages are the deltas of the finite state transductions.

Dedicated to Prof. G. Rozenberg on the occasion of his 60th birthday.

Gefeliciteerd, Grzegorz!

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho; Indexed Grammars, an Extension of Context-Free Grammars, J. of the ACM 15 (1968), 647–671

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Berstel; Transductions and Context-Free Languages, Teubner, Stuttgart, 1979

    Google Scholar 

  3. P. Christensen; Hyper-AFL’s and ET0L Systems, in L Systems (G. Rozenberg, A. Salomaa, Eds.), Lecture Notes in Computer Science 15, Springer-Verlag, Berlin, 1974, pp.254–257

    Google Scholar 

  4. K. Culik II; On Some Families of Languages Related to Developmental Systems, Internat. J. Comput. Math. 4 (1974), 31–42

    Article  MathSciNet  Google Scholar 

  5. W. Damm; The IO-and OI-hierarchies, Theoret. Comput. Sci. 20 (1982), 95–206

    Article  MATH  MathSciNet  Google Scholar 

  6. W. Damm, A. Goerdt; An Automata-Theoretical Characterization of the OI-hierarchy, Inform. and Control 71 (1986), 1–32

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Engelfriet, H.J. Hoogeboom; X-automata on ω-words, Theoret. Comput. Sci. 110 (1993), 1–51

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Engelfriet; Tree Automata and Tree Grammars, Lecture Notes, DAIMI FN-10, Aarhus, 1975

    Google Scholar 

  9. J. Engelfriet; Some Open Questions and Recent Results on Tree Transducers and Tree Languages, in Formal Language Theory; Perspectives and Open Problems (R.V. Book, Ed.), Academic Press, New York, 1980

    Google Scholar 

  10. J. Engelfriet; Hierarchies of Hyper-AFLs, J. of Comput. Syst. Sci. 30 (1985), 86–115

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Engelfriet; Context-Free Grammars with Storage, Leiden University, Technical Report 86-11, 1986

    Google Scholar 

  12. J. Engelfriet; Iterated Stack Automata and Complexity Classes, Inform. and Comput. 95 (1991), 21–75

    Article  MathSciNet  Google Scholar 

  13. J. Engelfriet, G. Rozenberg; Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages, J. of the ACM 27 (1980), 499–518

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Ehrenfeucht, G. Rozenberg, S. Skyum; A Relationship between the ET0L and EDT0L Languages, Theoret. Comput. Sci. 1 (1976), 325–330

    Article  MATH  MathSciNet  Google Scholar 

  15. J. Engelfriet, G. Rozenberg, G. Slutzki; Tree Transducers, L Systems, and Two-Way Machines, J. of Comput. Syst. Sci. 20 (1980), 150–202

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Engelfriet, E.M. Schmidt; IO and OI, J. of Comput. Syst. Sci. 15 (1977), 328–353, and J. of Comput. Syst. Sci. 16 (1978), 67–99

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Engelfriet, E.M. Schmidt, J. van Leeuwen; Stack Machines and Classes of Nonnested Macro Languages, J. of the ACM 27 (1980), 96–117

    Article  MATH  Google Scholar 

  18. J. Engelfriet, H. Vogler; Pushdown Machines for the Macro Tree Transducer, Theoret. Comput. Sci. 42 (1986), 251–369

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Engelfriet, H. Vogler; Look-Ahead on Pushdowns, Inform. and Comput. 73 (1987), 245–279

    Article  MATH  MathSciNet  Google Scholar 

  20. J. Engelfriet, H. Vogler; High Level Tree Transducers and Iterated Push down Tree Transducers, Acta Informatica 26 (1988), 131–192

    Article  MathSciNet  MATH  Google Scholar 

  21. S. Ginsburg; Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland/American Elsevier, Amsterdam/New York, 1975

    Google Scholar 

  22. S.A. Greibach; Chains of Full AFL’s, Math. Syst. Theory 4 (1970), 231–242

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  24. F. Gécseg, M. Steinby; Tree Languages, in Handbook of Formal Languages, Volume 3: Beyond Words (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, Berlin, 1997

    Google Scholar 

  25. I. Guessarian; Pushdown Tree Automata, Math. Syst. Theory 16 (1983), 237–263

    Article  MATH  MathSciNet  Google Scholar 

  26. T. Harju, J. Karhumäki; The Equivalence Problem of Multitape Finite Automata, Theoret. Comput. Sci. 78 (1991), 347–355

    Article  MATH  MathSciNet  Google Scholar 

  27. L. Kari, G. Rozenberg, A. Salomaa; L Systems, in Handbook of Formal Languages, Volume 1: Word, Language, Grammar (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, Berlin, 1997

    Google Scholar 

  28. M. Magidor, G. Moran; Finite Automata over Finite Trees, Techn. Report No. 30, Hebrew University, Jerusalem, 1969

    Google Scholar 

  29. G. Păun, G. Rozenberg, A. Salomaa; DNA Computing; New Computing Paradigms, Springer-Verlag, Berlin, 1998

    MATH  Google Scholar 

  30. M. Pelletier, J. Sakarovitch; On the Representation of Finite Deterministic 2-tape Automata, Theoret. Comput. Sci. 225 (1999), 1–63

    Article  MATH  MathSciNet  Google Scholar 

  31. W.C. Rounds; Mappings and Grammars on Trees, Math. Syst. Theory 4 (1970), 257–287

    Article  MATH  MathSciNet  Google Scholar 

  32. C. Gordon; Abstract Families of Languages, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 4, Utrecht, March 1970

    Google Scholar 

  33. J. Engelfriet; Tree Automata, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 5, Utrecht, March 1970

    Google Scholar 

  34. J. van Leeuwen; Brackets and Parentheses in the Theory of Context-Free Languages, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 6, Utrecht, December 1970

    Google Scholar 

  35. M. Nivat; Sur la fermeture rationnelle des cônes rationnels, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 4, Utrecht, March 1971

    Google Scholar 

  36. J. van Leeuwen; The General Theory of Translation, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 6, Utrecht, April 1971

    Google Scholar 

  37. J. Engelfriet; Tree Automata and Tree Transducers, Seminar on Automata Theory and Mathematical Linguistics (organized by G. Rozenberg), Abstract 8, Utrecht, May 1971

    Google Scholar 

  38. G. Rozenberg; Extension of Tabled 0L-systems and Languages, Internat. J. Comp. Inform. Sci. 2 (1973), 311–336

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  40. M.O. Rabin, D. Scott; Finite Automata and Their Decision Problems, IBM J. Res. 3 (1959), 115–125

    MathSciNet  Google Scholar 

  41. D. Scott; Some Definitional Suggestions for Automata Theory, J. of Comput. Syst. Sci. 1 (1967), 187–212

    MATH  Google Scholar 

  42. J.W. Thatcher; Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory, J. of Comput. Syst. Sci. 1 (1967), 317–322

    MATH  MathSciNet  Google Scholar 

  43. J.W. Thatcher; Tree Automata: An Informal Survey, in Currents in the Theory of Computing (A.V. Aho, Ed.), Prentice-Hall, Englewood Cliffs, 1973, pp.143–172

    Google Scholar 

  44. H. Vogler; Iterated Linear Control and Iterated One-Turn Pushdowns, Math. Syst. Theory 19 (1986), 117–133

    Article  MATH  MathSciNet  Google Scholar 

  45. H. Vogler; The OI-hierarchy Is Closed under Control, Inform. and Comput. 78 (1988), 187–204

    Article  MATH  MathSciNet  Google Scholar 

  46. M. Wand; An Algebraic Formulation of the Chomsky-Hierarchy, in Category Theory Applied to Computation and Control (E.G. Manes, Ed.), Lecture Notes in Computer Science 25, Springer-Verlag, Berlin, 1975, pp. 209–213

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Joost Engelfriet

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Engelfriet, J. (2002). The Delta Operation: From Strings to Trees to Strings. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43190-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation