Automata Theory with Modern Applications

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages. This is the only introductory book to cover such applications. It begins with a clear and readily understood exposition of the fundamentals that assumes only a background in discrete mathematics. The first five chapters give a gentle but rigorous coverage of basic ideas as well as topics not found in other texts at this level, including codes, retracts and semiretracts. Chapter 6 introduces combinatorics on words and uses it to describe a visually inspired approach to languages. The final chapter explains recently-developed language theory coming from developments in bioscience and DNA computing. With over 350 exercises (for which solutions are available), many examples and illustrations, this text will make an ideal contemporary introduction for students; others, new to the field, will welcome it for self-learning.

Table of Contents

1 Introduction

2 Languages and codes

3 Automata

4 Grammars

5 Turing machines

6 A visual approach to formal languages

7 From biopolymers to formal language theory

Appendix A Cardinality

Appendix B Co-compactness Lemma

About the Author

James A. Anderson

Professor of Mathematics and Chair of Division of Mathematics and Computer Science, University of South Carolina at Spartanburg.