Institute of Technology of Cambodia

Thories des automates-I3

Project AFD

1. Les automates Automatons are mathematical objects, widely used in computers, which allow modeling many systems (computers). The study of automaton began in the late fifties. It is based on many techniques (topology, graph theory, logic, algebra, etc...). Very informally, an automaton is a set of "system state", connected together by "transitions" that are marked by symbols. Given a "word" inputted, the controller reads the symbols of the word one by one and goes from state to state depending on the state of transitions. The word read is either accepted or rejected by the automaton. Before giving a more formal definition of the concepts described above, here is a few classic examples of use of automaton: Verification of an electronic circuit Search of occurrence in a text (search engine on the web, etc..) Verification of communication protocols Data Compression Compilation Biology (Genomics)) 2. Deterministic finite automaton A deterministic finite automaton is a five-fold (Q, X, , q0, F) consists of the following : a finite set of states (Q) a transition function (: Q*X Q ) an initial state (q0 Q) a set of final states (or accepting) F Q a finite alphabet (X) An AFD can be seen as an abstract machine. The machine starts reading the leftmost symbol being in the initial state q0. At a given moment, the machine is in state qi and reads a symbol Sj. The controller moves one symbol to the right and passes into the state qk if S (qi, sj) = qk After reading the entire word, if the automaton ends in the final state (qf F) then the word is accepted by the automaton. If not, the word is rejected.

Institute of Technology of Cambodia

Thories des automates-I3

3. Incomplete AFD Definition: If the transition function is not defined for certain symbols, we say that the automaton is incomplete. Ex: M2: (q1, b) = n (n: indefinite) (q4, a) = n M2 is incomplete. Solution: Let M (Q, X, , q 0, F). Adding a new state q 'to Q and we extend to ' such that all q Q and all a X o ' (q, a) = (q, a) if (q, a)! = Undefined o ' (q, a) = q if (q, a) = undefined o ' (q, a) = q '

4. Minimization of AFD AFD generally equivalent to an AFN in many states and it is necessary to minimize it. The purpose of the minimization is to construct an AFD with the minimum number of states and equivalent to a given AFD.