Finite Automata

by Mark V. Lawson

Overview

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

Product Details

ISBN-13:	9781040177129
Publisher:	CRC Press
Publication date:	09/17/2003
Sold by:	Barnes & Noble
Format:	eBook
Pages:	320
File size:	5 MB

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