Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Algebraic Theory of Automata Networks. An Introduction
Type
Physical Book
Publisher
Author
Collection
SIAM Monographs on Discrete Mathematics and Applications
Year
2004
Language
English
Pages
270
Format
Hardcover
Dimensions
22.90 x 15.20 cm
ISBN13
9780898715699

Algebraic Theory of Automata Networks. An Introduction

Pál Dömösi;Chrystopher L. Nehaniv (Author) · SIAM - Society for Industrial and Applied Mathematics · Hardcover

Algebraic Theory of Automata Networks. An Introduction - Pál Dömösi;Chrystopher L. Nehaniv

New Book Imported to Netherlands
Delivery: 26 Aug - 28 Aug Shipping: 13 to 14 business days.
€ 179,32
Import costs and 9% BTW included in the price ✅
€ 179,32

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Algebraic Theory of Automata Networks. An Introduction"

Investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. This volume 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.

Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. The authors also investigate automata networks as products of automata, that is, as compositions of automata obtained by cascading without feedback or with feedback of various restricted types or, most generally, with the feedback dependencies controlled by an arbitrary directed graph. This self-contained book surveys and extends the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others.

It 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. It contains several new methods and special techniques not discussed in other books, 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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews