1. Preliminary Introduction to the Theory of Computation
Lecturer：
Xuandong Li
Lei Bu TA
Yuming Wu
QQ Group ：

2. abstract models of computers and computation.
This course: A study of
abstract models of computers and computation.
Why theory, when computer field is so practical?
Theory provides concepts and principles, for both hardware and software that help us understand the general nature of the field.

3. Why Study Automata?
A survey of Stanford grads 5 years out asked which of their courses did they use in their job.
Basics like intro-programming took the top spots, of course.
But among optional courses, formal language and automata stood remarkably high.

4. How Could That Be? Regular expressions are used in many systems.
E.g., UNIX a.*b.
E.g., DTD’s describe XML tags with a RE format like person (name, addr, child*).
Finite automata model protocols, electronic circuits.

5. How? – (2)
Context-free grammars are used to describe the syntax of essentially every programming language.
Not to forget their important role in describing natural languages.

6. How? – (3)
When developing solutions to real problems, we often confront the limitations of what software can do.
Undecidable things – no program whatever can do it.
Intractable things – there are programs, but no fast programs.
Automata theory gives you the tools.

7. Outline Part 1: Preliminaries Part 2: Mathematical Knowledge
String and Language
Part 2:
Finite Automata and Regular Expression
Context Free Grammar and Pushdown Automata
Turing Automata

8. Part 3 Modeling: Part 4: Tutorials Transition System Petri Net
Timed and Hybrid Automata
Message Sequence Chart
Part 4: Tutorials
Computability
Model Checking
Trustworthy Software

9. Textbook Referred Reading WEB
John E. Hopcroft, Rajeev Motwani, Jeffery D.Ullman. Introduction to Automata Theory, Languages, and Computation, 3/E. Pearson Education India, (The Cinderella Book)
Referred Reading
Michael Sipser. Introduction to the Theory of Computation, 2nd Edition,Course Technology, 2005.
Derick Wood. Theory of Computation. HAPPER & ROW, 1987.
Doron Peled. Software Reliability Methods. Springer, 2011
WEB

10. Grading Assignment 30% Project 20% Final Exam 50%
Distributed in Class, due in next week.
Project 20%
Will be announced around middle November
Final Exam 50%