Equivalent definitions of recognizability for sets of graphs of bounded tree-width

We show that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an unbounded number of sources) if and only if it is recognizable with respect to the algebra of graphs of tree-width at most k with at most k sources.

[1]  Annegret Habel,et al.  Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement , 1991, Theor. Comput. Sci..

[2]  Bruno Courcelle,et al.  Recognizable sets of graphs: equivalent definitions and closure properties , 1994, Mathematical Structures in Computer Science.

[3]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[4]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[5]  Bruno Courcelle,et al.  Recognizable Sets of Graphs of Bounded Tree-Width , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[6]  Joost Engelfriet,et al.  Graph Grammars and Tree Transducers , 1994, CAAP.

[7]  Annegret Habel,et al.  A Comparison of Compatible, Finite, and Inductive Graph Properties , 1993, Theor. Comput. Sci..

[8]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[9]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[10]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[11]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[12]  S. Arnborg,et al.  Finding Minimal Forbidden Minors Using a Finite Congruence , 1991, ICALP.

[13]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..