6.2 Example: Finite Automata

Let A be a finite set whose element we call letters. A finite automaton over A consists of a finite set Q, whose elements we call states, a finite set of single letter transitions , a set of initial states and a set of final states .

• 6.2.1 Membership

• 6.2.2 Emptyness