Recognizability, hypergraph operations, and logical types

Information and Computation

Volumn 204, Issue 6, 2006, Pages 853-919

  Blumensath, A ^a   Courcelle, B ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Equational set; Graph operation; Logical type; Monadic second order logic; Monadic second order transduction; Recognizable set

Indexed keywords

ALGEBRA; BACTERIOPHAGES;

EQUATIONAL SETS; GRAPH OPERATIONS; LOGICAL TYPES; MONADIC SECOND-ORDER LOGIC; MONADIC SECOND-ORDER TRANSDUCTION; RECOGNIZABLE SETS;

FORMAL LOGIC;

EID: 84855189307     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.11.006     Document Type: Article

References (33)

1. R. Bloem, J. Engelfriet, A comparison of tree transductions defined by MSO logic and attribute grammars, Journal of Computer and System Sciences 61(2000) 1-50.
2. A. Blumensath, Structures of Bounded Partition Width, Ph. D. Thesis, RWTH Aachen, Aachen, 2003.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree Automata Techniques and Applications, available online at http://www.grappa.univ-lille3.fr/tata/.
4. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: [32], 1997, pp. 313-400.
5. B. Courcelle, Monadic second-order graph transductions: a survey, Theoretical Computer Science 126(1994) 53-75.
6. B. Courcelle, J. A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory of Computing Systems 33(2000) 125-150.
7. B. Courcelle, The monadic second-order logic of graphs VII: graphs as relational structures, Theoretical Computer Science 101(1992) 3-33.
8. B. Courcelle, P. Weil, The recognizability of sets of graphs is a robust property, Theoretical Computer Science 342(2005) 173-228. (Pubitemid 41203424)
9. B. Courcelle, J. A. Makowsky, Fusion in relational structures and the verification of monadic second-order properties, Mathematical Structures in Computer Science 12(2002) 203-235.
10. B. Courcelle, Basic notions of Universal Algebra for Language Theory and Graph Grammars, Theoretical Computer Science 163(1996) 1-54. (Pubitemid 126412003)
11. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-rewriting hypergraph grammars, Journal of Computer and System Science 46(1993) 218-270.
12. B. Courcelle, The monadic second-order logic of graphs VI: on several representations of graphs by relational structures, Discrete Applied Mathematics 54(1994) 117-149.
13. B. Courcelle, The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Theoretical Computer Science 80(1991) 153-202. (Pubitemid 21648907)
14. B. Courcelle, The monadic second-order logic of graphs XVI: canonical graph decompositions, Logical Methods in Computer Science 2(2006) 1-46.
15. B. Courcelle, S. Olariu, Upper bounds to the clique width of graphs, Discrete Applied Mathematics 101(2000) 77-114.
16. B. Courcelle, Recognizable sets of graphs: equivalent definitions and closure properties, Mathematical Structures in Computer Science 4(1994) 1-32.
17. B. Courcelle, J. Lagergren, Equivalent definitions of recognizability for sets of graphs of bounded tree-width, Mathematical Structures in Computer Science 6(1996) 141-165.
18. W. Cunningham, Decomposition of directed graphs, SIAM J. Alg. Discrete Methods 3(1982) 214-228.
19. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer Verlag, Berlin, 1995.
20. A. Ehrenfeucht, T. Harju, G. Rozenberg, The Theory of 2-structures, A Framework for Decompositions and Transformations of Graphs, World Scientific, Singapore, 1999.
21. J. Engelfriet, S. Maneth, Macro tree translations of linear size increase are MSO definable, SIAM Journal of Computers 32(2003) 950-1006.
22. J. Engelfriet, V. van Oostrom, Logical description of context-free graph-languages, Journal of Computer and System Sciences 55(1997) 489-503.
23. F. Gécseg, M. Steinby, Tree Automata, Akadémiai Kiado, Budapest, 1984.
24. F. Gécseg, M. Steinby, Tree Languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of formal languages, Vol. 3, Springer Verlag, 1997, pp. 1-68..
25. Y. Gurevich, Monadic second-order theories, in: J. Barwise, S. Feferman (Eds.), Model-Theoretic Logics, Springer, Berlin, 1985, pp. 479-506.
26. W. Hodges, Model Theory, Cambridge University Press, Cambridge, 1993.
27. D. Lapoire, Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width, in: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS, Lecture Notes in Computer Science, vol. 1373, 1998, pp. 618-628. (Pubitemid 128044824)
28. L. Libkin, Elements of Finite Model Theory, Springer Verlag, Berlin, 2004.
29. J. A. Makowsky, Algorithmic aspects of the Feferman-Vaught Theorem, Annals of Pure and Applied Logic 126(2004) 159-213.
30. J. E. Mezei, J. Wright, Algebraic automata and context-free sets, Information and Control 11(1967) 3-29.
31. J.-C. Raoult, A survey of tree-transduction, in: M. Nivat, A. Podelski (Eds.), Tree Automata and Languages, North-Holland, Amsterdam, pp. 311-325.
32. G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1: Foundations, World Scientific, Singapore, 1997.
33. S. Shelah, The monadic theory of order, Annals of Mathematics 102(1975) 379-419.