M = (Q,Σ,δ,q 0,F) Σ is the alphabet over which the transitions are defined.

Transcription

1 LECTURE Formal Definition of a DFA Definition 10.1 A Deterministic Finite Automaton (DFA) M, is a five-tuple: where M = (Q,Σ,δ, 0,F) Q is a finite set of states. It is important that the set of states e finite, otherwise it wouldn t e a finite Automaton. Σ is the alphaet over which the transitions are defined. δ is the transition function. The transition function descries each transition that takes as input a state and a symol from the alphaet, and produces another state. In the example (vending machine) we would say that given state 0 and input symol d, the transition function would produce state 10, or that δ(0,d) = 10, therefore, δ : Q Σ Q. 0 is the start state. F is the set of final (accepting) states. The DFA will compute y processing one input symol at a time, until all the input has een used. If the state that the machine is in when all the input has een used is one of those in F, the machine is said to Accept, otherwise it is said to Reject. Example. We are asked to design a DFA that accepts only those strings of a s and s that have two consecutive s. When designing a DFA it is important to assign meaning to each of the states. For example, in the case of the vending machine, each state represents the amount of money the vending machine has at that point. We will keep track of how many consecutive s have een read at a given time, y having 3 states. If the machine is in the first one (state 0) it means that it has not found two consecutive s and the last symol read is not a. In the second state (state 1), the machine has not found two consecutive s yet, and the last symol read is a, in the third state (state 2), the machine has found two consecutive s. We can descrie the transitions in the following way: From state 0: 1

2 If an a is found, continue in state 0, no new has een found. If a is found, move to state 1. The last symol read was a. From state 1: If an a is found, move to state 0. The last symol read is not a. If a is found, move to state 2. The last two symols read were s. From state 2: Once in state 2, we know that the string has two consecutive s regardless of other symols read. So the machine will remain in state 2 when an a or a are found. The start state is state 0, and the final state is state 2. The previous description can e represented y the following DFA. a a, a A machine can e descried in two ways 1. A transition diagram. As shown aove, a transition diagram contains all the information needed to descrie the DFA. It includes, the states, the alphaet, the transition function, the start state and the set of final states (with doule circle). 2. A formal description is given y explicitly showing all the five elements of a DFA. The following is a formal description of the machine shown aove in diagram form. M 1 = (Q 1,Σ 1,δ, 0,F) where: Q = {0,1,2} Σ = {a,} δ : Q Σ Q. δ can e descried as a tale, called a transition tale. δ a

3 0 = 0 F = {2} Computation Tracing To trace the computation of a DFA when reading an input string w we use instantaneous configurations. We already used instantaneous configurations when tracing the computation of a vending machine. Each instantaneous configuration showsthe currentstate ofthe DFAaswellasthe unusedinput, andis represented y the notation [current state, unused string]. From each instantaneous configuration we can go to the next configuration y following the transition tale. In this case we say that the first configuration yields the next configuration. Formally, [ i,ax] [δ( i,a),x] Where a Σ and x Σ. Example. Let us trace the computation of machine M 1, descried aove, on input aa. [0,aa] [0,a] since δ(0,a) = 0 [1,a] since δ(0,) = 1 [0,] since δ(1,a) = 0 [1,] since δ(0,) = 1 [2,ǫ] since δ(1,) = 2 The computation ends when there is no more input to read, in which case we write an ǫ (empty string) as the unused string. Since the computation ended in state 2, which is a final state 2 F, then the M 1 accepts the string aa. Sometimes we want to say that a computation yields some configuration after several steps, in which case we use the symol. In the example, we could use the notation [0,aa] [2,ǫ] to represent a seuence of steps from the initial configuration [0, aa] to the final configuration [2, ǫ] We say that a DFA M = (Q,Σ,δ, 0,F) accepts a string w, if the computation of M on input w ends in a final state. Formally, Definition 10.2 M accepts w Σ if [ 0,w] [ f,ǫ], and f F. The language of a machine M is the set of all those strings that are accepted y the machine. Formally, 3

4 Definition 10.3 Given a DFA M = (Q,Σ,δ, 0,F), the language of the machine M is L(M) = {w Σ M accepts w} Example. We are asked to design a DFA for the language L = {w Σ w has an even numer of a s and an odd numer of s} As we said efore, it is useful to design a DFA y assigning some meaning to each one of the states. In this case there are several option for the string read at a given point y our machine. The string could have either an even numer of a s, and an even numer of s ( e,e ) an even numer of a s, and an odd numer of s ( e,o ) an odd numer of a s, and an even numer of s ( o,e ) an odd numer of a s, and an odd numer of s ( o,o ) The laels appearing in parentheses represent the names of the states. So we will have four states. We can easily uild the transition function ased on the descriptionofthesestates. Forinstance, ifthe machineisin state e,o readingan a, we know that the machine already read an even numer of a s, after reading the a, the machine will have read an odd numer of a s, ut the numer of s won t change. Therefore the new state should e o,o. Figure shows the transition diagram of machine M. 4

5 e,e e,o a a a a o,e o,o Figure 1: Machine that accepts strings with even numer ofa s and odd numer of s 5