Algebraic Theory of Automata Networks
Buy a book... In Association with Amazon.co.uk
Author(s): P. Dömösi and C. Nehaniv
Publisher: SIAM
ISBN: 0898715695
Format: hardback
258pp
Price: $104.00
Review Date: 17 May 2005
Review: An automata network is a collection of automata connected together according to a directed graph D. The vertices of D are considered as automata and the edges indicate the existence of communication links. Thus D has no parallel edges. Each automaton can change its state at discrete time steps as a local transition function of the states and global input, and synchronous action of the local state transitions defines a global transition on the entire network. This introduction deals with finite automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings and fields. It summarises the results of the last 40 years regarding automata networks and presents many new results that have been discovered since the last book on the subject was published.