Finite Automata

Prelims

Chapter 1 - Introduction to finite automata

Chapter 2 - Recognisable languages

Chapter 3 - Non-deterministic automata

Chapter 4 - ε -automata

Chapter 5 - Kleene's Theorem

Chapter 6 - Local languages

Chapter 7 - Minimal automata

Chapter 8 - The transition monoid

Chapter 9 - The syntactic monoid

Chapter 10 - Algebraic language theory

Chapter 11 - Star-free languages

Chapter 12 - Varieties of languages

Appendix A - Discrete mathematics

Bibliography

Index