有界树宽图的可定义性等于可识别性
Definability equals recognizability for graphs of bounded treewidth
摘要：
我们证明了一个猜想的Courcelle，它指出，一个图形属性是可定义的MSO与模块计数谓词图的恒定树宽，当且仅当它是可识别的在以下意义上：恒定宽度树分解的图形满足的属性可以识别树自动机。虽然前向蕴涵是一个经典的事实，称为库尔塞勒定理，反向方向仍然开放
英文摘要：
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree decompositions of graphs satisfying the property can be recognized by tree automata. While the forward implication is a classic fact known as Courcelle's theorem, the converse direction remained open
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
