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.
These proceedings contain all the papers that were presented at the Third - ternational Conference on Language and Automata Theory and Applications (LATA 2009), held in Tarragona, Spain, during April...
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by...
The purpose of this book is to present an up to date account of fuzzy ideals of a semiring. The book concentrates on theoretical aspects and consists of eleven chapters including three invited...
It is with great pleasure that I present this fourth vol ume in the series "Advanced Applications in Pattern Recognition." It would be difficult to find two authors better versed in the design and...