22C:135 Theory of Computation

Lecture Notes for Fall Semester 2008

Class Management

Part 2: Finite Automata and Regular Languages

  • Introduction to Finite Automata
  • Finite Automata
  • Formal Definition of Computation
  • The Regular Operations
  • Nondeterminism
  • Nondeterministic Finite Automata
  • Closure under Regular Operations
  • Transducers
  • Application to DFA State Minimization
  • Regular Expressions
  • Equivalence of Regular Expressions and Finite Automata
  • Pumping Lemma for Regular Languages