G. Bagan, MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay, Conf. on Computer Science Logic (CSL), pp.167-181, 2006.
DOI : 10.1007/11874683_11

T. Colcombet, A Combinatorial Theorem for Trees, In Intl. Coll. on Automata, Languages and Programming, pp.901-912, 2007.
DOI : 10.1007/978-3-540-73420-8_77
URL : https://hal.archives-ouvertes.fr/hal-00192024

B. Courcelle, Graph Rewriting: An Algebraic and Logic Approach In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp.193-242, 1990.

B. Courcelle, Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, pp.2675-2700, 2009.
DOI : 10.1016/j.dam.2008.08.021
URL : https://hal.archives-ouvertes.fr/hal-00333846

A. Durand and E. Grandjean, First-order queries on structures of bounded degree are computable with constant delay, ACM Transactions on Computational Logic, vol.8, issue.4, 2007.
DOI : 10.1145/1276920.1276923
URL : https://hal.archives-ouvertes.fr/hal-00195016

J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, Journal of the ACM, vol.49, issue.6, pp.716-752, 2002.
DOI : 10.1145/602220.602222

M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Ann. Pure Appl. Logic, vol.130, pp.1-3, 2004.

W. Kazana and L. Segoufin, First-order query evaluation on structures of bounded degree, Logical Methods in Computer Science, vol.7, issue.2, 2011.
DOI : 10.2168/LMCS-7(2:20)2011

D. Seese, Linear Time Computable Problems and First-Order Descriptions, Mathematical Structures in Computer Science, vol.6, issue.6, pp.505-526, 1996.

S. Shelah, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037

W. Thomas, Classifying regular events in symbolic logic, Journal of Computer and System Sciences, vol.25, issue.3, pp.360-376, 1982.
DOI : 10.1016/0022-0000(82)90016-2