Paperback. 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. Recent applications to bioscience have created a new audience for automata theory and formal languages. This is the only introduction to cover such applications. With over 350 exercises, many examples and illustrations, this is an ideal contemporary introduction for students; others, new to the field, will welcome it for self-learning. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9780521613248

Contact seller

Report this item

Bibliographic Details

Title: Automata Theory with Modern Applications (Paperback)
Publisher: Cambridge University Press, Cambridge
Publication Date: 2006
Language: English
ISBN 10: 0521613248
ISBN 13: 9780521613248
Binding: Paperback
Edition: 1st Edition
Condition: new

About this title

Synopsis

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.

About the Author

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

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

The Nile Group Pty Ltd
42 Apex Drive, Truganina, VIC, 3029, Australia

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Shipping Terms

Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.