The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent ideal

This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding work in what is now called algebraic engineering, an emerging

For upper level courses on Automata. Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages. This is the only introductor

Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compress