Automata Theory with Modern Applications
1st Edition
Published on 17. August 2006
978-0-511-22301-3 (ISBN)
Description
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.
Reviews / Votes
'Anderson's book gives an excellent, clearly written account of automata theory.' SIAM ReviewMore details
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
College/higher education
Professional and scholarly
Illustrations
Worked examples or Exercises; 5 Tables, unspecified
File size
1,60 MB
ISBN-13
978-0-511-22301-3 (9780511223013)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
James A. Anderson
Automata Theory with Modern Applications
Book
06/2006
Cambridge University Press
€78.30
Shipment within 15-20 days
James A. Anderson
Automata Theory with Modern Applications
Book
06/2006
Cambridge University Press
€108.50
Shipment within 15-20 days
Person
Professor of Mathematics and Chair of Division of Mathematics and Computer Science, University of South Carolina at Spartanburg.
Content
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; Bibliography; Index.
