Finite Automata
A finite-state automaton (or finite automaton) is a special kind of finite-state machine. It may be viewed as a finite-state machine A = (S, I, O, f, g, s0) in which the set of output symbols is {0, 1}. Those states for which the last output is 1 are called accepting states.
A finite automaton M consists of
-
-
-
A subset F of S of accepting states/ final states, and
-
-