Abstract
The infinite tree obtained classically by unfolding the definition of a recursive scheme, contains several identical subtrees. When they are identified, the resulting graph is generated by a deterministic graph grammar, if the scheme is monadic. We show how to extract one such a grammar from the scheme.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten, J.A. Bergstra, J.W. Klop Decidability of bisimulation equivalence for processes generating context-free languages, LNCS 259, p. 94–111, 1987.
H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plesmeijer, M.R. Sleep Term graph rewriting, LNCS 259, p. 141–158, 1987.
M. Bauderon On systems of equations defining infinite graphs, LNCS 344, p. 54–73, 1989.
R. Büchi Regular canonical systems, Archiv für Mathematische Logik und Grundlagenforschung 6, p. 91–111, 1964.
D. Caucal A fast algorithm to decide on simple grammars equivalence, LNCS 401, p. 66–85, 1989.
D. Caucal On the regular structure of prefix rewritings, LNCS 431, p. 87–102, 1990.
D. Caucal, R. Monfort On the transition graphs of automata and grammars, WG 90, to appear in LNCS, 1990.
B. Courcelle Une forme canonique pour les grammaires simples déterministes, Rairo 1, p. 19–36, 1974.
B. Courcelle Fundamental properties of infinite trees, TCS 25, p. 95–169, 1983.
B. Courcelle The monadic second-order logic of graphs, II: infinite graphs of bounded width, Math. Syst. Theory 21, p. 187–222, 1989.
B. Courcelle The definability of equational graphs in monadic second order logic, LNCS 372, p. 207–221, 1989.
B. Courcelle, J. Vuillemin Completeness result for the equivalence of recursive schemes, JCSS 12, p. 179–197, 1976.
S. Garland, D. Luckam Program schemes, recursion schemes, and formal languages, JACM 7, p. 119–160, 1973.
I. Guessarian Algebraic semantics, LNCS 79, 1981.
A. Habel, H.J. Kreowski Some structural aspects of hypergraph languages generated by hyperedge replacement, LNCS 247, p. 207–219, 1987.
B. Hoffmann, D. Plump Jungle evaluation for efficient term rewriting, LNCS 343, p. 191–203, 1988.
Ianov The logical schemes of algorithms, Problems of cybernetic, USSR, p. 82–140, 1960.
R. Kennaway On ‘on graph rewritings', TCS 52, p. 37–58, 1988.
D. Muller, P. Schupp The theory of ends, pushdown automata, and second order logic, TCS 37, p. 51–75, 1985.
M. Nivat On the interpretation of polyadic recursive schemes, Symposia Mathematica 15, Academic Press, 1975.
P. Padawitz Graph grammars and operational semantics, TCS 19, p. 117–141, 1982.
J.-C. Raoult On graph rewritings, TCS 32, p. 1–24, 1984.
J. Staples Computation on graph-like expressions, TCS 10, p. 171–185, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caucal, D. (1991). An application of graph grammars to the elimination of redundancy from functions defined by schemes. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017390
Download citation
DOI: https://doi.org/10.1007/BFb0017390
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive