1. MSO queries on tree decomposable structures are computable with linear delay;Bagan,2006
2. Random generation for finitely ambigous context-free languages;Bertoni;Theoret. Inform. Appl.,2001
3. H. Comon, et al., Tree Automata Techniques and Applications, Book online, freely readable: http://tata.gforge.inria.fr/
4. The expression of graph properties and graph transformations in monadic second-order logic;Courcelle,1997
5. Query efficient implementations of graphs of bounded clique-width;Courcelle;Discrete Appl. Math.,2003