Finite automaton
Finite automaton 0 1 2 3 4 5 6 7 a b ab a a c a a a b b
Finite automaton A finite automaton M is a 5-tuple(0, o, A, 2,8) O is a finite set of states qo∈ O is the start states A is a distinguished set of accepting states 2 is a finite input alphabet ● S is a function from O× 2 into C, called the transition function of M
Finite automaton A finite automaton M is a 5-tuple ( Q, q 0, A, ∑, δ ) y Q is a finite set of states, y q 0 ∈ Q is the start states, y A Q is a distinguished set of accepting states, y ∑ is a finite input alphabet, y δ is a function from Q × ∑ into Q, called the transition function of M. ⊆