An Automaton is a device which recognises or accepts certain elements of Σ*, where Σ is a finite alphabet. Since the elements accepted by an automaton are a subset of Σ*, they form a language. Therefore each automaton will recognise or accept a language contained in Σ*. The language of Σ* consisting of the words accepted by an automaton M is the language over Σ* accepted by M and denoted by M(L)>

Definition 3.1

A deterministic automaton, denoted by (Σ,Q,s0,ϒ,F) , consists of a finite alphabet Σ, a finite set Q of states, and a function called the transition function and a set F of acceptance states.