Algebraic Theory of Automata Networks: A Introduction
Author(s): Pál Dõmõsi (Author), Chrystopher L. Nehaniv (Author)
Publisher: SIAM: Society for Industrial and Applied Mathematics
Publication Date: December 1, 2004
Language: English
Print length: 270 pages
ISBN-10: 0898715695
ISBN-13: 9780898715699
Book Description
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Automata networks are investigated as products of automata, and the fundamental results in regard to automata networks are surveyed and extended, including the main decomposition theorems of Letichevsky, and of Krohn and Rhodes. The text summarizes the most important results of the past four decades regarding automata networks and presents many new results discovered since the last book on this subject was published. Several new methods and special techniques are discussed, including characterization of homomorphically complete classes of automata under the cascade product; products of automata with semi-Letichevsky criterion and without any Letichevsky criteria; automata with control words; primitive products and temporal products; network completeness for digraphs having all loop edges; complete finite automata network graphs with minimal number of edges; and emulation of automata networks by corresponding asynchronous ones.
Editorial Reviews
Review
‘This self-contained monograph covers the foundations of what is currently known about automata networks, giving the reader sufficient theoretical background to be at the forefront of research in many related areas.’ Alexandra Kireeva, Mathematical Reviews
Book Description
This book investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories.
About the Author
Pal Domosi is Professor of Informatics and Chair of the Department of Computer Science at the Faculty of Informatics at the University of Debrecen, Hungary. His primary research interest is the theory of formal languages and automata. He is also interested in fast algorithms regarding certain problems of software engineering.
Chrystopher L. Nehaniv is Research Professor of Mathematical and Evolutionary Computer Sciences with the Algorithms and Adaptive Systems Research Groups in the School of Computer Science at the University of Hertfordshire, U.K. He is Director of the EPSRC Network on Evolvability in Biological and Software Systems and is Associate Editor of the journals BioSystems and Interaction Studies. Chrystopher L. Nehaniv is Research Professor of Mathematical and Evolutionary Computer Sciences with the Algorithms and Adaptive Systems Research Groups in the School of Computer Science at the University of Hertfordshire, U.K. He is Director of the EPSRC Network on Evolvability in Biological and Software Systems and is Associate Editor of the journals BioSystems and Interaction Studies.
Wow! eBook
