Finite Automata / Edition 1

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 both aspects, this book provides a well-motivated introduction to the mathematical theory of finite automata.

The first half of Finite Automata focuses on the computer science side of the theory and culminates in Kleene's Theorem, which the author proves in a variety of ways to suit both computer scientists and mathematicians. In the second half, the focus shifts to the mathematical side of the theory and constructing an algebraic approach to languages. Here the author proves two main results: Schützenberger's Theorem on star-free languages and the variety theorem of Eilenberg and Schützenberger.

Accessible even to students with only a basic knowledge of discrete mathematics, this treatment develops the underlying algebra gently but rigorously, and nearly 200 exercises reinforce the concepts. Whether your students' interests lie in computer science or mathematics, the well organized and flexible presentation of Finite Automata provides a route to understanding that you can tailor to their particular tastes and abilities.

Product Details

ISBN-13:	9781584882558
Publisher:	Taylor & Francis
Publication date:	09/17/2003
Pages:	320
Product dimensions:	6.40(w) x 9.30(h) x 0.90(d)

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