1. Reachability is harder for directed than for undirected graphs;Ajtai;J. Symbolic Logic,1990
2. Problems easy for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. Graph expressions and graph rewritings;Bauderon;Math. Systems Theory,1987
4. Weak second-order logic and finite automata;Büchi;Z. Math. Logik Grundlagen Math.,1960
5. Graph rewriting: An algebraic and logic approach;Courcelle,1990