Tree-verifiable graph grammars introduce syntactic restrictions ensuring CMSO-definability of associated languages with bounded embeddable tree-width.
Tree-verifiable graph grammars ensure CMSO-definability with bounded embeddable tree-width.
Tree-verifiable graph grammars ensure CMSO-definability with bounded embeddable tree-width.