Showing papers by "Jens Lagergren published in 1993"

Recognizable Sets of Graphs of Bounded Tree-Width

Abstract: We establish 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 with at most k sources. We obtain a somewhat stronger result for sets of simple finite graphs of tree-width at most k.