Skip to main content
SpringerLink
Log in

Some structural aspects of hypergraph languages generated by hyperedge replacement

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

Hyperedge replacement systems are introduced as a device for generating hypergraph languages including graph languages and string languages (where the strings are uniquely represented as certain graphs). Our concept combines a context-free type of rewriting with a comparatively large generative power. The former is indicated, for example, by a pumping lemma, the latter by the examples (among them you find the refinement of Petri nets, the analysis of flow diagrams, the structural description of molecules and some typical non-context-free string languages).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewriting, Comp. Sci. Research Report no. 8525, University of Bordeaux (1985)

    Google Scholar 

  2. C. Batini, A. D'Atri: Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design, Lect. Not. Comp. Sci. 100, 177–194 (1981)

    Google Scholar 

  3. C. Berge: Graphs and Hypergraphs, North-Holland (1973)

    Google Scholar 

  4. I. Castellani, U. Montanari: Graph Grammars for Distributed Systems, Lect. Not. Comp. Sci. 153 (1983), 20–38

    Google Scholar 

  5. V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science and Biology, Lect. Not. Comp. Sci. 73 (1979)

    Google Scholar 

  6. H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars, Lect. Not. Comp. Sci. 73, 1–19 (1979)

    Google Scholar 

  7. H. Ehrig, A. Habel, B.K. Rosen: Rosen: Concurrent Transformations of Relational Structures, Fundamenta Informaticae IX 13–50 (1986)

    Google Scholar 

  8. H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B.K. Rosen, and J. Winkowski: Transformations of Structures: An Algebraic Approach, Math. Syst. Theory 14, 305–334 (1981)

    Google Scholar 

  9. H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science, Lect. Not. Comp. Sci. 153 (1983)

    Google Scholar 

  10. R. Farrow, K. Kennedy, L. Zucconi: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Ann. IEEE Symp. on Found. of Comp. Sci., Houston, Texas, Oct. 1976, 42–56

    Google Scholar 

  11. J. Feder: Plex Languages, Inform. Sci. 3 (1971), 225–241

    Google Scholar 

  12. A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, LNCS 153, 143–158 (1983)

    Google Scholar 

  13. —: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3/85 (1985), to appear in Theor. Comp. Sci.

    Google Scholar 

  14. J.E. Hopcroft, J.D. Ullman: Formal Languages and Their Relation to Automata, Addison-Wesley 1969

    Google Scholar 

  15. D. Janssens, G. Rozenberg: On the Structure of Node-Label-Controlled Graph Grammars, Information Science 20, 191–216 (1980)

    Google Scholar 

  16. H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977

    Google Scholar 

  17. —: A Pumping Lemma for Context-Free Graph Languages, LNCS 73, 270–283 (1979)

    Google Scholar 

  18. U. Lichtblau: Decompilation of Control Structures by Means of Graph Transformations, LNCS 185, 284–297 (1985)

    Google Scholar 

  19. M. Nagl: A Tutorial and Bibliographical Survey on Graph Grammars, LNCS 73, 70–126 (1979)

    Google Scholar 

  20. T. Pavlidis: Linear and Context-Free Graph Grammars, Journ. ACM 19, 1, 11–23 (1972)

    Google Scholar 

  21. V. Rajlich: Dynamics of Discrete Systems and Pattern Reproduction, Journ. Comp. Syst. Sci. 11, 186–202 (1975)

    Google Scholar 

  22. H. Schmeck: Flow Graph Grammars and Flow Graph Languages, in M. Nagl, J. Perl (eds.): Graphtheoretic Concepts in Computer Science, Proc. of the WG' 83, 319–329 (1983)

    Google Scholar 

  23. I. Suzuki, T. Murata: Stepwise Refinements of Transitions and Places, Informatik-Fachberichte 52, Springer, 136–141 (1980)

    Google Scholar 

  24. R. Valette: Analysis of Petri Nets by Stepwise Refinements, Journ. Comp. Syst. Sci. 18, 35–46 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Bremen, Postfach 33 04 40, D-2800, Bremen 33

    Annegret Habel & Hans-Jörg Kreowski

Authors
  1. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Habel, A., Kreowski, HJ. (1987). Some structural aspects of hypergraph languages generated by hyperedge replacement. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039608

Download citation

  • DOI: https://doi.org/10.1007/BFb0039608

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation