(演绎法).pptVIP

Chapter 1 Automata: the Methods the Madness Outline 1.1 Why Study Automata Theory? 1.2 Introduction to Formal Proof 1.3 Additional Forms of Proof 1.4 Inductive Proofs 1.5 Central Concepts of Automata Theory 1.1 Why Study Automata Theory? 1.1.1 Introduction to Automata Properties of finite-state systems Having a finite number of states Entire history cannot be remembered. Good to implement with a fixed set of resources Can be modeled by finite automata (FA) 1.1 Why Study Automata Theory? Example 1.1 --- an FA modeling an on/off switch Example 1.2 --- an FA modeling recognition of the keyword “then” in a lexical analyzer The double circles specify the final or “accepting state.” 1.1 Why Study Automata Theory? 1.1.2 Structural Representation Two other models (not automaton-like) Grammar --- processing data with a recursive structure E.g., grammatical rule E ? E + E for generating arithmetic expressions Regular expression --- describing text strings E.g., UNIX-style regular expression ’[A-Z][a-z]*[ ][A-Z][A-Z]’ describes Ithaca NY, Lafayette IN… 1.1 Why Study Automata Theory? 1.1.3 Automata and Complexity What can a computer do? --- Computability: Studying problems which can be solved by computer, called decidable problems. Decidability is the main topic in computability. 1.1 Why Study Automata Theory? 1.1.3 Automata and Complexity What can a computer do efficiently? --- Computational Complexity: Studying tractable problems solvable with some slowly growing function (like polynomial) of input size, intractable problems solvable with fast growing function (like exponential). Intractability is the main topic of computational complexity. 1.2 Introduction to Formal Proof 1.2.0 Concepts --- Formal proof techniques are indispensable for proving theorems in theory of computation. Understanding workings of correct programs is equivalent to proving theorems by induction. 1.2 Introduction to Formal Proof 1.2.1 Deductive Proofs (演繹法) Given facts (e