Algebraic and Structural Automata Theory

Front Cover
B. Mikolajczak
Elsevier, Jan 14, 1991 - Mathematics - 401 pages
0 Reviews
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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter 0 Basic mathematical concepts
1
Chapter 1 Automata and languages
7
Chapter 2 Finite automata
35
Chapter 3 Minimization of automata
83
Chapter 4 Input subautomata
119
Chapter 5 Automata homomorphisms
155
Chapter 6 Realizations of automata State assignment
197
Chapter 7 Realizations of automata Structures of nets
229
Chapter 8 Timevarying automata
269
Chapter 9 Transforms and extensions of automata
301
Chapter 10 Periodic sums of automata
319
Chapter 11 Linear automata
347
Bibliography
371
Index
387
Copyright

Common terms and phrases

Bibliographic information