Algebraic Theory of Automata Networks

Algebraic Theory of Automata Networks

Author: Pal Domosi

Publisher: SIAM

Published: 2005-01-01

Total Pages: 270

ISBN-13: 9780898718492

DOWNLOAD EBOOK

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. They survey and extend the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others.


Algebraic Engineering - Proceedings Of The First International Conference On Semigroups And Algebraic Eng And Workshop On For

Algebraic Engineering - Proceedings Of The First International Conference On Semigroups And Algebraic Eng And Workshop On For

Author: Chrystopher L Nehaniv

Publisher: World Scientific

Published: 1999-05-14

Total Pages: 586

ISBN-13: 981454423X

DOWNLOAD EBOOK

There is algebraic structure in time, computation and biological systems. Algebraic engineering exploits this structure to achieve better understanding and design. In this book, pure and applied results in semigroups, language theory and algebra are applied to areas ranging from circuit design to software engineering to biological evolution.


Semigroups, Formal Languages and Groups

Semigroups, Formal Languages and Groups

Author: J.B. Fountain

Publisher: Springer

Published: 1995-05-31

Total Pages: 448

ISBN-13:

DOWNLOAD EBOOK

Semigroups, Formal Languages and Groups contains articles that provide introductory accounts of recent research in rational languages and their connections with finite semigroups, including the celebrated BG=PG theorem, infinite languages, free profinite monoids and their applications to pseudovarieties, parallel complexity classes related to automata, semigroups and logic, algebraic monoids, geometric methods in semigroup presentations, automatic groups and groups acting on Lambda-trees. There is also an extensive survey of algorithmic problems in groups, semigroups and inverse monoids. In addition, the book includes hitherto unpublished research on monoids of Lie type and their representations, free actions of groups on Lambda-trees and an extension to arbitrary semigroups of the famous Krohn-Rhodes theorem.


Applications of Automata Theory and Algebra

Applications of Automata Theory and Algebra

Author: John L. Rhodes

Publisher: World Scientific

Published: 2010

Total Pages: 293

ISBN-13: 9812836969

DOWNLOAD EBOOK

This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding work in what is now called algebraic engineering, an emerging field created by using the unifying scheme of finite state machine models and their complexity to tie together many fields: finite group theory, semigroup theory, automata and sequential machine theory, finite phase space physics, metabolic and evolutionary biology, epistemology, mathematical theory of psychoanalysis, philosophy, and game theory. The author thus introduced a completely original algebraic approach to complexity and the understanding of finite systems. The unpublished manuscript, often referred to as "The Wild Book," became an underground classic, continually requested in manuscript form, and read by many leading researchers in mathematics, complex systems, artificial intelligence, and systems biology. Yet it has never been available in print until now. This first published edition has been edited and updated by Chrystopher Nehaniv for the 21st century. Its novel and rigorous development of the mathematical theory of complexity via algebraic automata theory reveals deep and unexpected connections between algebra (semigroups) and areas of science and engineering. Co-founded by John Rhodes and Kenneth Krohn in 1962, algebraic automata theory has grown into a vibrant area of research, including the complexity of automata, and semigroups and machines from an algebraic viewpoint, and which also touches on infinite groups, and other areas of algebra. This book sets the stage for the application of algebraic automata theory to areas outside mathematics. The material and references have been brought up to date bythe editor as much as possible, yet the book retains its distinct character and the bold yet rigorous style of the author. Included are treatments of topics such as models of time as algebra via semigroup theory; evolution-complexity relations applicable to both ontogeny and evolution; an approach to classification of biological reactions and pathways; the relationships among coordinate systems, symmetry, and conservation principles in physics; discussion of "punctuated equilibrium" (prior to Stephen Jay Gould); games; and applications to psychology, psychoanalysis, epistemology, and the purpose of life. The approach and contents will be of interest to a variety of researchers and students in algebra as well as to the diverse, growing areas of applications of algebra in science and engineering. Moreover, many parts of the book will be intelligible to non-mathematicians, including students and experts from diverse backgrounds.


A Book of Abstract Algebra

A Book of Abstract Algebra

Author: Charles C Pinter

Publisher: Courier Corporation

Published: 2010-01-14

Total Pages: 402

ISBN-13: 0486474178

DOWNLOAD EBOOK

Accessible but rigorous, this outstanding text encompasses all of the topics covered by a typical course in elementary abstract algebra. Its easy-to-read treatment offers an intuitive approach, featuring informal discussions followed by thematically arranged exercises. This second edition features additional exercises to improve student familiarity with applications. 1990 edition.