Finite Automata, Formal Logic, and Circuit Complexity

One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup­ theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger.