Advertisement

A maximum path length pumping lemma for edge-replacement languages

  • Sabine Kuske
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 710)

Abstract

This paper contains a new pumping lemma for the class of edge-replacement languages where the pumping of a graph increases the maximum path length. Moreover, we present a decidable boundedness problem and a sublinear growth property for edge-replacement languages which can be shown by using this special pumping lemma.

Keywords

edge-replacement grammar pumping lemma maximum path length 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BM 82]
    C. Bader, A. Moura: A Generalization of Ogden's Lemma, ACM 29, 404–407, 1982CrossRefGoogle Scholar
  2. [BPS 61]
    Y. Bar-Hillel, M. Perles, E. Shamir: On Formal Properties of Simple Phrase-Structure Grammars, Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143–177, 1961Google Scholar
  3. [CER 79]
    V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979Google Scholar
  4. [CM 90]
    B. Courcelle, M. Mosbah: Monadic Second-Order Evaluations on Tree-Decomposable Graphs, Technical Report, Univ. Bordeaux, 1990Google Scholar
  5. [EKR 91]
    H. Ehrig, H.-J. Kreowski, G. Rozenberg: Graph-Grammars and Their Application to Computer Science, LNCS 532, 1991Google Scholar
  6. [ENR 83]
    H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, LNCS 153, 1983Google Scholar
  7. [ENRR 87]
    H. Ehrig, M. Nagl, A. Rosenfeld, G. Rozenberg (eds.): Graph Grammars and Their Application to Computer Science, LNCS 291, 1987Google Scholar
  8. [Ha 89]
    A. Habel: Hyperedge Replacement: Grammars and Languages, Ph.d. thesis, Univ. Bremen, 1989.Google Scholar
  9. [HK 83]
    A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, LNCS 153, 143–158, 1983Google Scholar
  10. [HK 87]
    A. Habel, H.-J. Kreowski: Characteristics of Graph Languages Generated by Edge Replacement, Theor. Comp. Sci., 51, 81–115, 1987CrossRefGoogle Scholar
  11. [HKV 89a]
    A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, Acta Informatica 26, 657–677, 1889.CrossRefGoogle Scholar
  12. [HKV 89b]
    A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement, Proc. Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), LNCS 351, 275–289, 1989Google Scholar
  13. [HU 79]
    J. E. Hopcroft, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979Google Scholar
  14. [Kr 77]
    H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph.d. thesis, Technische Univ. Berlin, 1977Google Scholar
  15. [Kr 79]
    H.-J. Kreowski: A Pumping-Lemma for Context-Free Graph Languages, LNCS 73, 270–283, 1979Google Scholar
  16. [Kr 86]
    H.-J. Kreowski: Rule Trees Represent Derivations in Edge Replacement Systems, in G. Rozenberg, A. Salomaa (eds.): The Book of L, Springer-Verlag, Berlin, 217–232, 1986Google Scholar
  17. [Ku 91]
    S. Kuske: Ein Pumping-Lemma für Kantenersetzungssprachen bezüglich maximaler Weglänge, master thesis, Univ. Bremen, 1991Google Scholar
  18. [Og 68]
    W. Ogden: A Helpful Result for Prooving Inherent Ambiguity, Math. Systems Theory 2, 191–194, 1968CrossRefGoogle Scholar
  19. [Wi 76]
    D.S. Wise: A Strong Pumping Lemma for Context-Free Languages, Theoret. Comp. Science 3, 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Sabine Kuske
    • 1
  1. 1.Fachbereich Mathematik und InformatikUniversität BremenBremen 33

Personalised recommendations