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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Bader, A. Moura: A Generalization of Ogden's Lemma, ACM 29, 404–407, 1982
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, 1961
V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979
B. Courcelle, M. Mosbah: Monadic Second-Order Evaluations on Tree-Decomposable Graphs, Technical Report, Univ. Bordeaux, 1990
H. Ehrig, H.-J. Kreowski, G. Rozenberg: Graph-Grammars and Their Application to Computer Science, LNCS 532, 1991
H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, LNCS 153, 1983
H. Ehrig, M. Nagl, A. Rosenfeld, G. Rozenberg (eds.): Graph Grammars and Their Application to Computer Science, LNCS 291, 1987
A. Habel: Hyperedge Replacement: Grammars and Languages, Ph.d. thesis, Univ. Bremen, 1989.
A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, LNCS 153, 143–158, 1983
A. Habel, H.-J. Kreowski: Characteristics of Graph Languages Generated by Edge Replacement, Theor. Comp. Sci., 51, 81–115, 1987
A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, Acta Informatica 26, 657–677, 1889.
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, 1989
J. E. Hopcroft, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, 1979
H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph.d. thesis, Technische Univ. Berlin, 1977
H.-J. Kreowski: A Pumping-Lemma for Context-Free Graph Languages, LNCS 73, 270–283, 1979
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, 1986
S. Kuske: Ein Pumping-Lemma für Kantenersetzungssprachen bezüglich maximaler Weglänge, master thesis, Univ. Bremen, 1991
W. Ogden: A Helpful Result for Prooving Inherent Ambiguity, Math. Systems Theory 2, 191–194, 1968
D.S. Wise: A Strong Pumping Lemma for Context-Free Languages, Theoret. Comp. Science 3, 1976
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuske, S. (1993). A maximum path length pumping lemma for edge-replacement languages. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive