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

作     者：Courcelle, Bruno Lagergren, Jens 

作者机构：Université Bordeaux-1 LaBRI 351 cours de la Libération Talence33405 France Department of Numerical Analysis and Computing Science Royal Institute of Technology StockholmS-100 44 Sweden 

出 版 物：《Mathematical Structures in Computer Science》 (Math. Struct. Comput. Sci.)

年 卷 期：1996年第6卷第2期

页      面：141-165页

核心收录：

学科分类：0828[工学-农业工程] 08[工学] 0901[农学-作物学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：by ESPRIT Basic Research Working Group COMPUGRAPH. by the Swedish Natural Sciences Research Council 

主　　题：Algebra 

摘      要：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. Copyright © Cambridge University Press 1996.