🤖 AI Summary
This paper addresses the characterization of graph languages that are simultaneously logically definable and syntactically generable—specifically, those definable in counting monadic second-order logic (CMSO) and generated by hyperedge replacement (HR) grammars. Methodologically, it bridges Courcelle and Engelfriet’s logical characterization of graph languages with Bojańczyk and Pilipczuk’s MSO-definability theory for tree decompositions, yielding a novel recognition-theoretic characterization for finitely generated subalgebras of the HR algebra. The main contribution is the establishment of strict equivalence among four classes: CMSO-definable graph languages, HR-grammar-generated graph languages, recognizable graph languages of bounded treewidth, and images of MSO-transductions from trees to graphs. This unified framework provides a complete tripartite characterization—logical, grammatical, and algebraic—of context-free graph structures, thereby enhancing decidability and model-checking capabilities for such graph languages.
📝 Abstract
We give a characterization of the sets of graphs that are both definable in Counting Monadic Second Order Logic (CMSO) and context-free, i.e., least solutions of Hyperedge-Replacement (HR) grammars introduced by Courcelle and Engelfriet. We prove the equivalence of these sets with: (a) recognizable sets (in the algebra of graphs with HR-operations) of bounded tree-width; we refine this condition further and show equivalence with recognizability in a finitely generated subalgebra of the HR-algebra of graphs; (b) parsable sets, for which there is an MSO-definable transduction from graphs to a set of derivation trees labelled by HR operations, such that the set of graphs is the image of the set of derivation trees under the canonical evaluation of the HR operations; (c) images of recognizable unranked sets of trees under an MSO-definable transduction, whose inverse is also MSO-definable. We rely on a novel connection between two seminal results, a logical characterization of context-free graph languages in terms of tree to graph MSO-definable transductions, by Courcelle and Engelfriet and a proof that an optimal-width tree decomposition of a graph can be built by an MSO-definable transduction, by Bojanczyk and Pilipczuk.
