Algebraic and Structural Automata Theory

Description

Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development. The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups. Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory. Content: Advisory Editors Page ii Edited by Page iii Copyright page Page iv Introduction Pages v-xi Preface Page xiii Dedication Page xv 0. Basic mathematical concepts Pages 1-6 1. Automata and languages Pages 7-34 2. Finite automata Pages 35-82 3. Minimization of automata Pages 83-117 4. Input subautomata Pages 119-153 5. Automata homomorphisms Pages 155-196 6. Realizations of automata. State assignment Pages 197-228 7. Realizations of automata. Structures of nets Pages 229-268 8. Time-varying automata Pages 269-299 9. Transforms and extensions of automata Pages 301-317 10. Periodic sums of automata Pages 319-346 11. Linear automata Pages 347-369 Bibliography Pages 371-386 Index Pages 387-402