In this talk, I plan to speak about a class of techniques used for establishing linear time algorithms for problems in classes of graphs. The approach will be via automata theory and will be logical in flavour. I also plan to look at Seese's results concerning the limitations of this approach.