|
" Algebraic theory of automata networks : "
Pál Dömösi, Chrystopher L. Nehaniv.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
1016212
|
| Doc. No
|
:
|
b770582
|
| Main Entry
|
:
|
Dömösi, Pál.
|
| Title & Author
|
:
|
Algebraic theory of automata networks : : an introduction /\ Pál Dömösi, Chrystopher L. Nehaniv.
|
| Publication Statement
|
:
|
Philadelphia :: Society for Industrial and Applied Mathematics,, ©2005.
|
| Series Statement
|
:
|
SIAM monographs on discrete mathematics and applications
|
| Page. NO
|
:
|
xii, 258 pages :: illustrations ;; 26 cm.
|
| ISBN
|
:
|
0898715695
|
|
|
:
|
: 9780898715699
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (pages 237-252) and index.
|
| Contents
|
:
|
Preliminaries -- Directed graphs, automata, and automata networks -- Krohn-Rhodes theory and complete classes -- Without Letichevsky's criterion -- Letichevsky's criterion -- Primitive products and temporal products -- Finite state-homogeneous automata networks and asynchronous automata networks.
|
| Abstract
|
:
|
"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."
|
|
|
:
|
"This book is intended to provide 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, especially chapters about Krohn-Rhodes theory, primitive products, and temporal products, as well as general and various special types of automata networks."--Jacket.
|
| Subject
|
:
|
Algebra, Abstract.
|
| Subject
|
:
|
Computer networks.
|
| Subject
|
:
|
Machine theory.
|
| Subject
|
:
|
Semigroups.
|
| Subject
|
:
|
Algèbre abstraite.
|
| Subject
|
:
|
Automates mathématiques, Théorie des.
|
| Subject
|
:
|
Réseaux d'ordinateurs.
|
| Subject
|
:
|
Semi-groupes.
|
| Subject
|
:
|
Algebra, Abstract.
|
| Subject
|
:
|
Computer networks.
|
| Subject
|
:
|
Machine theory.
|
| Subject
|
:
|
Semigroups.
|
| Subject
|
:
|
Algebraische Automatentheorie.
|
| Dewey Classification
|
:
|
004.6
|
| LC Classification
|
:
|
QA276.D653 2005
|
| NLM classification
|
:
|
ST 136rvk
|
| Added Entry
|
:
|
Nehaniv, Chrystopher L.,1963-
|
| |