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.

Contemporary introduction to automata theory that uniquely also covers some modern applications to bioscience.

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

Reviews
'Anderson's book gives an excellent, clearly written account of automata theory.' SIAM Review



Book Information
ISBN 9780521613248
Author James A. Anderson
Format Paperback
Page Count 260
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 374g
Dimensions(mm) 227mm * 151mm * 14mm