Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences

Jakub Gajarsky, Petr Hlineny, Marc Herbstritt
2012 Foundations of Software Technology and Theoretical Computer Science  
We prove, in the universe of trees of bounded height, that for any MSO formula with m variables there exists a set of kernels such that the size of each of these kernels can be bounded by an elementary function of m. This yields a faster MSO model checking algorithm for trees of bounded height than the one for general trees. From that we obtain, by means of interpretation, corresponding results for the classes of graphs of bounded tree-depth (MSO 2 ) and shrub-depth (MSO 1 ), and thus we give
more » ... de generalizations of Lampis' (ESA 2010) and Ganian's (IPEC 2011) results. In the second part of the paper we use this kernel structure to show that FO has the same expressive power as MSO 1 on the graph classes of bounded shrub-depth. This makes bounded shrub-depth a good candidate for characterization of the hereditary classes of graphs on which FO and MSO 1 coincide, a problem recently posed by Elberfeld, Grohe, and Tantau (LICS 2012).
doi:10.4230/lipics.fsttcs.2012.112 dblp:conf/fsttcs/GajarskyH12 fatcat:wit3in442fe4pn23tikkr6d54y