6533b834fe1ef96bd129d486

RESEARCH PRODUCT

Tree automata, tree decomposition and hyperedge replacement

Clemens Lautemann

subject

Discrete mathematicsSPQR treeSpanning treeK-ary treeComputer scienceTree decompositionCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTree structureGomory–Hu treeTree automatonGraph propertyComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS

description

Recent results concerning efficient solvability of graph problems on graphs with bounded tree-width and decidability of graph properties for hyperedge-replacement graph grammars are systematised by showing how they can be derived from recognisability of corresponding tree classes by finite tree automata, using only well-known techniques from tree-automata theory.

https://doi.org/10.1007/bfb0017410