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

Monograph( based very largely upon results original to the Czechoslovakian authors) presents an abstract account of the theory of automata for sophisticated rea

Although there are some books dealing with algebraic theory of automata, their contents consist mainly of Krohn-Rhodes theory and related topics. The topics in

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 major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The