Categories
theory

Rabin-Scott Finite Automata and Their Decision Problems

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.