State machine methods

Papers on automata theory and sequential functions

The automata theoretic roots of process algebra.

Large State Machines and Sequential functions 

 

Classic papers

  • “Loop free products” (1961). Hartmanis paper that helped connect automata theory to semigroup theory – also contains a definition of the general product (feedback product).
  • Rabin-Scott Finite Automata and Their Decision Problems. (1958) One of the most important Computer Science papers introduced finite state machine language recognizers,  the equivalence between non-deterministic and deterministic finite automata (in terms of what languages they recognize) , the Myhill congruences,  etc.