Abstract
We establish that every equational graph can be characterized, up to isomorphism, by a formula of monadic second-order logic. It follows that the isomorphism of two equational graphs is decidable. Equational graphs can be used to describe the behaviour of recursive applicative program schemes. We obtain a sufficient and decidable condition for the equivalence of these program schemes.
Notes: • Formation associée au CNRS (Centre National de la Recherche Scientifique). • This work has been supported by the "Programme de Recherches Coordonnées : Mathématiques et Informatique" and by the ESPRIT-Basic Research Action contract 3299 "Computing by Graph Transformation". • Electronic mail : mcvax!inria!geocub!courcell (on UUCP) or : courcell@geocub.greco-prog.fr
Preview
Unable to display preview. Download preview PDF.
References
ADAMEK J.,KOUBEK V.,Least fixed point of a functor, J.Comput.System Sci. 19 (1979) 163–178.
BAUDERON M., On systems of equations defining infinite graphs, Lec.Notes Computer Science 344, (1989) 54–73.
BAUDERON M., COURCELLE B.,Graph expressions and graph rewritings, Mathematical System Theory 20 (1987) 83–127.
BÜCHI J.,Weak second-order logic and finite automata, Z. Math.Logik Grundlagen Math. 5 (1960) 66–92.
COURCELLE B.,An axiomatic approach to the Korenjak-Hopcroft algorithms,Math.Systems Theory 16 (1983) 191–231.
COURCELLE B., Fundamental properties of infinite trees, Theor.Comp. Sci. 25 (1983) 95–169.
COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor.Comp.Sci. 42 (1986), 1–122.
COURCELLE B., The monadic second-order logic of graphs, I: Recognizable sets of finite graphs, Research report 8837 Bordeaux I University, 1988. To appear in Information and Computation.
COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoretical Computer Science 55 (1987) 141–181.
COURCELLE B., A representation of graphs by algebraic expressions and its use for graph rewriting systems, Proc. of the 3rd international workshop on graph grammars, Lec.Notes Computer Sci.291 (1987), pp.112–132.
COURCELLE B.,On the use of context-free graph grammars for analysing recursive definitions, in "Programming of Future Generation Computers II", L. Kott and K. Fuchi eds., Elsevier, Amsterdam 1988, pp.83–122.
COURCELLE B., The monadic second-order logic of graphs, II: Infinite graphs of bounded width, to appear in Mathematical Systems Theory.
COURCELLE B., The monadic second-order logic of graphs: Definable sets of finite graphs, Workshop on Graph Theoretical Concepts in Computer Science, Lec. Notes Computer Sci. 344 (1989) 30–53.
COURCELLE B., Recursive applicative program schemes, in "Handbook of Theoretical Computer Science" J.Van Leeuwen ed.,Elsevier, to appear.
COURCELLE B., The monadic second-order logic of graphs III: Tree-width,Forbidden Minors,and Complexity issues, Research report 8852,submitted for publication.
COURCELLE B., The monadic second-order logic of graphs IV: Every equational graph is definable,Report 8830, submitted for publication.
GUESSARIAN I., Algebraic Semantics, Lec.Notes Computer Sci., 99,1981.
RABIN M., Decidability of 2nd-order theories and automata on infinite trees, Trans. of Amer. Math. Soc. 141 (1969) 1–35.
RABIN M., Automata on infinite objects and Church's Problem, A.M.S., Regional Conference Series in Mathematics, vol 13, 1972.
RABIN M., Weakly definable relations and special automata in "Mathematical Logic and Foundations of set Theory, Bar-Hillel ed., North-Holland, 1972, pp.1–23.
THOMAS W.,Automata on infinite objects, same volume as [14].
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1989). The definability of equational graphs in monadic second-order logic. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035762
Download citation
DOI: https://doi.org/10.1007/BFb0035762
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive