Online ordering will be unavailable from 07:00 GMT to 17:00 GMT on Sunday, June 15.

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Algebraic Theory of Automata Networks

Algebraic Theory of Automata Networks

Algebraic Theory of Automata Networks

A Introduction
Pál Dõmõsi , Debreceni Egyetem, Hungary
Chrystopher L. Nehaniv , University of Hertfordshire
December 2004
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Hardback
9780898715699

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

$111.00
USD
Hardback

    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.

    • Provides graduate students and newcomers to the field with ideas, methods, and results of algebraic theory of automata networks
    • Researchers and engineers working in the area may find the book useful as well
    • Summarises 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

    Reviews & endorsements

    '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

    See more reviews

    Product details

    December 2004
    Hardback
    9780898715699
    270 pages
    260 × 183 × 17 mm
    0.669kg
    This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.

    Table of Contents

    • Preface and overview
    • 1. Preliminaries
    • 2. Directed graphs, automata, and automata networks
    • 3. Krohn-Rhodes theory and complete classes
    • 4. Without Letichevsky's criterion
    • 5. Letichevsky's criterion
    • 6. Primitive products and temporal products
    • 7. Finite state-homogeneous automata networks and asynchronous automata networks
    • Bibliography
    • Index.
      Authors
    • Pál Dõmõsi , Debreceni Egyetem, Hungary
    • Chrystopher L. Nehaniv , University of Hertfordshire