情报科学部-FniteAutomataandNonDeterminism.pptVIP

Finite Automata andNon Determinism http://cis.k.hosei.ac.jp/~yukita/ Definition 1.1: Finite Automaton State Diagram for M1 Data Representation for M1 Task 01DFA Implement M1 with your favorite programming language. GUI Two buttons for input 0 and 1 State chart with the current state highlighted Language of M1 State Diagram for M5 Data Representation for M5 Informal Description of M5 M5 keeps a running count of the sum of the numerical symbols it reads, modulo 3. Every time it receives the RESET symbol it resets the count to 0. M5 accepts if the sum is 0, modulo 3. Definition 1.7: Regular Language A language is called a regular language if some finite automaton recognizes it. Example 1.9: A finite automaton E2 E2 recognizes the regular language of all strings that contain the string 001 as a substring. 0010, 1001, 001, and 1111110011110 are all accepted, but 11 and 0000 are not. Find a set of states of E2 You haven’t just seen any symbols of the pattern, have just seen a 0, have just seen 00 or, have just seen the entire pattern 001. Assign the states q,q0,q00, and q001 to these possibilities. Draw a State Diagram for E2 Regular Operations on Languages Example 1.11 Theorem 1.12 Closedness for Union Proof of Theorem 1.12 Construction of M Correctness You should check the following. For any string recognized by M1 is recognized by M. For any string recognized by M2 is recognized by M. For any string recognized by M is recognized by M1 or M2. Theorem 1.13 Closedness for concatenation Nondeterminism To prove Theorem 1.13, we need nondeterminism. Nondeterminism is a generalization of determinism. So, every deterministic automaton is automatically a nondeterministic automaton. Nondetermistic Finite Automata A nondeterministic finite automaton can be different from a deterministic one in that for any input symbol, nondeterministic one can transit to more than one states. epsilon transition NFA and DFA stand for nondeterministic finite automaton and deterministic finite