计 算 理 论新.ppt

Formal Language;Computation;;Language;Sentence and Alphabet;Rules/Grammar;Notation of language;Notation of language;String operations;The empty string;Another operation;The * operation;Operations on languages ;Operations on languages;Topics about Language;Contests ;Text book;References ;Goal;Homework;Honor and Collaboration;Exam;Grading Policy;Instructor;TA;TA;Good good study;Finite Automata(FA);Deterministic Finite Automata(DFA);Example 1 Auto-gate;Example 1 Auto-gate;Example 2 ;Example 2 ;Formal Definition of DFA;DFA for example 1 Auto-gate;DFA for example 2;Diagram Notation of DFA;Table Notation of DFA;Partition Strings;Example 3;Construction of DFA ;Example 4 ;Example 4 ;Example 4 ;Extending transition function to string ;The language of a DFA ;Regular language;Example 5;Example 6;Nondeterministic Finite Automata(NFA);Example 2.1 Construct a DFA to accept;Example 2.1 Construct a DFA to accept;Example 2.1 Construct a DFA to accept;Example 2.1 Construct a DFA to accept; L = {w | w consists of 0’s and 1’s , and the tenth symbol from the right end is 1 };Formal Definition of NFA;Example 2.2 Construct an NFA to accept;Example 2.2 Construct an NFA to accept;Diagram and Table Notation;Description;Example 2.3 Construct an DFA to accept;Extending transition function to string ;The language of NFA ;An Exercise ;Equivalence of DFA and NFA;Equivalence : NFA ? DFA;Example 2.4;{q0};“Lazy evaluation” :;Bad case;Nondeterministic Finite Automata;An Exercise ;Formal Definition of ?-NFA; ?- transition;An ?- NFA for real number;?- closure;Extending transition to strings;Example 3.1;Convert an ?-NFA to DFA;Minimization of Automata;D;Table-filling algorithm;Minimization of DFA’s;Minimization of DFA’s; Summary; Summary;Example 3.3;Exercise 2.2.6;Exercise 2.2.5(a);Exercise 2.2.6;Example 3.4