# Monadic second-order definable graph transductions

## Abstract

Formulas of monadic second-order logic can be used to specify graph transductions, i.e., multivalued functions from graphs to graphs. We obtain in this way classes of graph transductions, called *monadic second-order definable graph transductions* (or more simply *definable transductions*) that are closed under composition and preserve the two known classes of context-free sets of graphs, namely the class of Hyperedge Replacement (HR) and the class of Vertex Replacement (VR) sets. These two classes can be characterized in terms of definable transductions and recognizable sets of finite trees. These characterizations are independent of the rewriting mechanisms used to define the HR and VR grammars. When restricted to words, the definable transductions are strictly more powerful than the rational transductions with finite image; they do not preserve context-free languages. We also describe the sets of discrete (edgeless) labeled graphs that are the images of HR and VR sets under definable transductions: this gives a version of Parikh's Theorem (i.e., the characterization of the commutative images of context-free languages) which extends the classical one and applies to HR and VR sets of graphs.

## Keywords

Derivation Tree Graph Grammar Rational Transduction Vertex Replacement Recognizable Language## Preview

Unable to display preview. Download preview PDF.

## References

- [ALS]ARNBORG S., LAGERGREN J., SEESE D., Problems easy for tree-decomposable graphs, J. of Algorithms 12 (1991) 308–340Google Scholar
- [BC]BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987) 83–127Google Scholar
- [Ber]BERSTEL J., Transductions and context-free languages, Teubner Verlag, Stuttgart, 1979Google Scholar
- [Bra]BRANDENBURG F.-J., The equivalence of boundary and confluent graph grammars on graph languages with bounded degree, L.N.C.S. 488 (1991)Google Scholar
- [Bü]BÜCHI J., Weak second-order logic and finite automata, Z. Math. Logik Grundlagen Math. 5 (1960) 66–92Google Scholar
- [Cou1]COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theoret. Comput. Sci. 42 (1986) 1–122Google Scholar
- [Cou2]COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987) 141–181Google Scholar
- [Cou3]COURCELLE B., Graph rewriting: An algebraic and logic approach, in “Handbook of Theoretical Computer Science, Volume B”, J. Van Leeuwen ed., Elsevier, 1990, pp. 193–242Google Scholar
- [Cou4]COURCELLE B., The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990) 12–75Google Scholar
- [Cou5]COURCELLE B., The monadic second-order logic of graphs II: Infinite graphs of bounded width, Mathematical Systems Theory, 21 (1989) 187–221Google Scholar
- [Cou6]Courcelle B., The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues, RAIRO Informatique Théorique et Applications, to appear.Google Scholar
- [Cou7]COURCELLE B., The monadic second-order logic of graphs IV: Definability properties of equational graphs, Annals Pure Applied Logic 49 (1990) 193–255Google Scholar
- [Cou8]COURCELLE B., The monadic second-order logic of graphs V: On closing the gap between definability and recognizability, Theoret. Comput. Sci. 80 (1991) 153–202Google Scholar
- [Cou9]COURCELLE B., The monadic second order logic of graphs VI: On several representations of graphs by relational structures, Report 89-99, Discrete Applied Mathematics, to appear (see also Logic in Computer Science 1990, Philadelphia)Google Scholar
- [Cou10]COURCELLE B., The monadic second order logic of graphs VII: Graphs as relational structures, Theoret. Comput. Sci., in press, Research Report 91-40, short version in the proceedings of the 4th International Workshop on Graph Grammars, L.N.C.S. 532 (1991) 238–252Google Scholar
- [Cou11]COURCELLE B., On the structure of context-free sets of graphs generated by vertex replacement, Research Report, Bordeaux-1 University, to appear.Google Scholar
- [Cou12]COURCELLE B., Graph grammars, monadic second-order logic and the theory of graph minors, Proceedings of the Graph Minors Conference, Seattle, June 1991, Contemporary Mathematics, American Mathematical Society, to appear.Google Scholar
- [CE]COURCELLE B., Engelfriet J., A logical characterization of the sets of hypergraphs generated by hyperedge replacement grammars, Research Report 91-41, Bordeaux-1 University, 1991, submitted.Google Scholar
- [CER]COURCELLE B., ENGELFRIET J., ROZENBERG G., Handle-rewriting hypergraph grammars, Report 90-84, Bordeaux-1 University, to appear in J.C.S.S.; Short version in the proceedings of the 4th International Workshop on Graph Grammars, L.N.C.S. 532, (1991) 253–268Google Scholar
- [CM]COURCELLE B., Mosbah M., Monadic second-order evaluations on tree-decomposable graphs, Research report 90-110, Bordeaux-1 University, to appear in Theoret. Comput. Sci., (extended abstract in the Proceedings of WG'91, L.N.C.S., to appear.)Google Scholar
- [DHLT]DAUCHET M., HEUILLARD T., LESCANNE P., TISON S., Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems, Information and Computation 88 (1990) 187–201Google Scholar
- [Don]DONER J., Tree acceptors and some of their applications, J. Comput. Syst. Sci. 4 (1970) 406–451Google Scholar
- [Elg]ELGOT C., Decision problems of finite automata design and related arithmetics, Trans. A.M.S. 98 (1961)21–52Google Scholar
- [Eng1]ENGELFRIET J., Context-free NCE graph grammars, Proc. FCT 89, L.N.C.S. 380 (1989) 148–161Google Scholar
- [Eng2]ENGELFRIET J., A characterization of context-free NCE graph languages by monadic second-order logic on trees, L.N.C.S. 532 (1991) 311–327Google Scholar
- [EH1]ENGELFRIET J., HEYKER L., The string generating power of context-free hypergraph grammars, J. Comp. Syst. Sci. 43 (1991) 328–360Google Scholar
- [EH2]ENGELFRIET J., HEYKER L., Hypergraph languages of bounded degree, report 91-01, Univ. Leiden, 1991Google Scholar
- [ER1]ENGELFRIET J., ROZENBERG G., A comparison of boundary graph grammars and context-free hypergraph grammars, Information and Computation 84 (1990) 163–206Google Scholar
- [ER2]ENGELFRIET J., ROZENBERG G., Graph grammars based on node rewriting: an introduction to NLC graph grammars, L.N.C.S. 532 (1991) 12–23Google Scholar
- [ERS]ENGELFRIET J., ROZENBERG G., SLUTZKI G., Tree transducers, L systems and two-way machines, J. Comput. System Sci. 20 (1980) 150–202Google Scholar
- [GS]GECSEG F., STEINBY M., Tree automata, Akademiai Kiado, Budapest, 1984Google Scholar
- [Gu]GUREVICH Y., Monadic second-order theories, in J. Barwise and S. Feferman eds., “Model theoretic logic”. Springer, Berlin, 1985, pp. 479–506Google Scholar
- [Hab]HABEL A., Hyperedge replacement: grammars and languages, Doctoral dissertation, Bremen 1989Google Scholar
- [HK]HABEL A., KREOWSKI H.J., May we introduce to you: Hyperedge replacement?, Proceedings of the 3
^{rd}International Workshop on Graph Grammars, L.N.C.S. 291 (1987) 15–26Google Scholar - [JR]JANSSENS D., ROZENBERG G., A survey of NLC grammars, L.N.C.S. 159 (1983) 114–128Google Scholar
- [Lan]LANGE K.-J., Context-free controlled ETOL systems, Proceedings of 10th ICALP, L.N.C.S. 154 (1980) 723–733Google Scholar
- [Rab]RABIN M., A simple method for undecidability proofs and some applications, in “Logic, Methodology and Philosophy of Science II”, Y. Bar-Hilleled., North-Holland, Amsterdam, 1965, pp. 58–68Google Scholar
- [Rab]RAOULT J.-C., A survey of tree transductions, INRIA report 1410, to appear in the proceedings of an ASMICS workshop held in LeTouquet, France, June 1990, M. Nivat and A. Podelski eds.Google Scholar
- [RW]ROZENBERG G., WELZL E., Boundary NLC grammars, Basic definitions, normal forms and complexity, Information and Control 69 (1986) 136–167Google Scholar
- [Tho]THOMAS W., Automata on infinite objects, same volume as [Cou3] pp.133–192Google Scholar