Finite Automata and Their Decision Problem

The paper "Finite Automata and Their Decision Problem" by Michael Oser Rabin and Dana S. Scott is a foundational work in automata theory. It introduced the concept of nondeterministic machines, which significantly advanced the field.12

The paper addresses the "decision problem," which in formal logic and mathematics, is about finding an algorithm to definitively answer "yes" or "no" to a given question within a specific system. Rabin and Scott's work explored this problem in the context of finite automata, which are simplified models of computation. These automata, also known as finite-state acceptors, can recognize specific sets of words or strings. The paper's contribution was crucial for understanding the capabilities and limitations of these early computational models.34512