Interest in finite automata theory continues to grow, not only because of its applications in computer science, but also because of more recent applications in mathematics, particularly group theory and symbolic dynamics. The subject itself lies on the boundaries of mathematics and computer science, and with a balanced approach that does justice to

chapter 1|26 pages

Introduction to finite automata

chapter 2|26 pages

Recognisable languages

chapter 3|32 pages

Non-deterministic automata

chapter 4|12 pages


chapter 5|30 pages

Kleene’s Theorem

chapter 6|14 pages

Local languages

chapter 7|30 pages

Minimal automata

chapter 8|20 pages

The transition monoid

chapter 9|26 pages

The syntactic monoid

chapter 10|18 pages

Algebraic language theory

chapter 11|30 pages

Star-free languages

chapter 12|14 pages

Varieties of languages