[Verse 1] Start with a five-tuple definition clear Q is states, Sigma's alphabet here Delta maps each state and symbol to one Q-zero starts us, F marks when we're done [Chorus] DFA, DFA, deterministic way One path forward, never led astray Five components working hand in hand Accept or reject, that's the master plan Q states, Sigma symbols, Delta's the guide Q-zero starts, F decides if we ride [Verse 2] Draw your circles connected by arrows straight Each input symbol seals your machine's fate Transition table shows the same design Rows are states, columns mark each sign [Chorus] DFA, DFA, deterministic way One path forward, never led astray Five components working hand in hand Accept or reject, that's the master plan Q states, Sigma symbols, Delta's the guide Q-zero starts, F decides if we ride [Verse 3] Extended delta-star processes strings complete From starting state through symbols we meet If final state belongs to F's collection String is accepted, passes inspection [Bridge] Strings ending zero-one, we can detect Even number of ones, architect Divisibility checks, patterns so neat DFA makes these tasks complete [Chorus] DFA, DFA, deterministic way One path forward, never led astray Five components working hand in hand Accept or reject, that's the master plan Q states, Sigma symbols, Delta's the guide Q-zero starts, F decides if we ride [Outro] Finite states, finite rules Automata theory's foundational tools DFA shows us computation's start Deterministic finite art
← 2 What Is Computation? | 2 Nondeterministic Finite Automata (NFA) →