Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata

► We outline how pathwidth and treewidth are related to cospan decompositions. ► We define several width measures and show that they all coincide. ► In addition we give an application to graph automata. ► We illustrate our results with several examples.