Deterministic Finite Automata
Ashwin Lall · Mathematical Foundations of Computer Science · 2024
We are now ready to study a simple model of computation. As computer scientists, we have to understand the computing models that we working with to determine what is easily computable and (later in this book) what is not computable at all. The first model of computation that we will study is called a deterministic finite automaton or DFA (plural: deterministic finite automata).