Advertisement

On the generation of trees by hyperedge replacement

  • Frank Drewes
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1295)

Abstract

A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars is established. It says that these sets are exactly those of the form val(T), where T, a set of terms over hyperedge-replacement operations, is the output language of a finite-copying top-down tree transducer. Furthermore, the terms in T may be required to consist of hyperedge-replacement operations whose underlying hypergraphs are hypertrees. The result is closely related to a similar characterization that was obtained for the case of string graphs by Engelfriet and Heyker some years ago. In fact, the results of this paper also yield a new proof for the characterization by Engelfriet and Heyker.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AU71]
    Alfred V. Aho and Jeffrey D. Ullman. Translations on a context free grammar. Information and Control, 19:439–475, 1971.CrossRefGoogle Scholar
  2. [Cou91]
    Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theoretical Computer Science, 80:153–202, 1991.CrossRefGoogle Scholar
  3. [DHK97]
    Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformations. Vol. I: Foundations, chapter 2, pages 95–162. World Scientific, 1997.Google Scholar
  4. [Dre97]
    Frank Drewes. A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars. Report 3/97, Univ. Bremen, 1997.Google Scholar
  5. [EH91]
    Joost Engelfriet and Linda Heyker. The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences, 43:328–360, 1991.CrossRefGoogle Scholar
  6. [Eng77]
    Joost Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory, 10:289–303, 1977.CrossRefGoogle Scholar
  7. [Eng97]
    Joost Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 3, pages 125–213. Springer, 1997.Google Scholar
  8. [ERS80]
    Joost Engelfriet, Grzegorz Rozenberg, and Giora Slutzki. Tree transducers, L systems, and two-way machines. Journal of Computer and System Sciences, 20:150–202, 1980.CrossRefGoogle Scholar
  9. [GS97]
    Ferenc Gécseg and Magnus Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. III: Beyond Words, chapter 1, pages 1–68. Springer, 1997.Google Scholar
  10. [Hab92]
    Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, 1992.Google Scholar
  11. [MW67]
    J. Mezei and Jesse B. Wright. Algebraic automata and context-free sets. Information and Control, 11:3–29, 1967.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Frank Drewes
    • 1
  1. 1.Department of Computer ScienceUniversity of BremenBremenGermany

Personalised recommendations