Formal Languages and Theory of Computation.ppt

Formal Languages and Theory of Computation Wen-Hsiang Tsai 蔡文祥 講座教授 2011/9 Chapter 0 Introduction Outline 0.0 Reasons for Taking This Course 0.1 General Concepts 0.2 Problems Studied in Theory of Computation 0.3 Fields Related to Theory of Computation 0.4 Applications of Theory of Computation 0.5 Brief History of Theory of Computation 0.6 Textbooks and Course Grading 0.0 Reasons for Taking This Course Philosophy of computer science CS Indispensable for complete study of CS Broadening views in all fields of CS Enhancing problem solving capability Basic training for undergraduate students Background course for graduate students Qualification exam topic for Ph. D. students. 0.1 General Concepts Course title --- “Formal Languages and Theory of Computation” 正規語言與計算理論 Scope of course: Formal languages Automata theory Computability Computational complexity 0.1 General Concepts Formal Languages --- Definition --- Study of “strings of symbols,” including their descriptions, properties, generations, recognitions, compiling, applications, … 0.1 General Concepts Formal Languages --- Concepts 1/2 --- Strings of symbols include those of natural languages, computer languages, discrete signals, … 0.1 General Concepts Formal Languages --- Concepts 2/2 --- Results of study of automatic processing of symbolic information Parallel to numerical mathematical processing Similar to the role of set theory 集合論 in mathematics 0.1 General Concepts Automata Theory --- A question --- Do you know how a vending machine works? Can you design one? 0.1 General Concepts Automata Theory --- An example 1/3 --- How to design a vending machine ? Use a finite automaton! 0.1 General Concepts Automata Theory --- An example 2/3 --- Assumptions for simplicity : Only NT 5-dollar and 10-dollar coins are used. Only drinks all of 20 dollars are sold. 0.1 General Concepts 0.1 General Concepts 0.1 General Concepts Automata Theory --- Definition --- Study of dynamic behaviors of “discr