Lecture Notes:
- Introduction (pdf)
- Finite-state-automata (pdf)
- Building finite-state models/automata (pdf)
- Converting non-deterministic FSA to FSA (pdf)
- State-minimization for FSA (pdf)
- Regular expression (pdf)
(ps)
- Homomorphism of Regular Languages (pdf)
- Robot motion control by FSA (pdf)
- Push-down Automata (pdf)
- Context-free Grammar (pdf)
- Pumping Lemma for Context-free Grammar (pdf)
- Presburger arithmetic (pdf)
- Turing Machine (pdf)