Table of Contents

Introduction to Finite Automata. Recognisable Languages. Non-Deterministic Automata. e-Automata. Kleene's Theorem. Local Languages. Minimal Automata. The Transition Monoid. The Syntactic Monoid. Algebraic Language Theory. Star-Free Languages. Varieties of Languages. Appendix: Discrete Mathematics. Bibliography. Index

About the Author

Lawson, Mark V.

Reviews

"Lawson's book is well written, self-contained, and quite extensive. The material is fully explained, with many examples fully discussed, and with many and varied exercises. Students using this book will get a broad education in finite-automata theory." - SIAM Review "[This book] is a nice textbook intended for an undergraduate lecture. All presented results are illustrated by many simple examples. The book is self-contained and easy to read. It can be recommended as a textbook for undergraduate lectures about finite automata." - EMS Newsletter