2 Finite Automata
Klaus Denecke, Shelly L. Wismath · 2018
In Section 1.2 we introduced a finite automaton as a multi-based algebra of the form 7-1 = (Z, X; 8, zo), where (1) Z is a finite non-empty set of states; (2) X is the (finite) input alphabet; (3)6:ZxX-3Zis the state transition function; and (4) zo E Z is an initial state.