Graph Algebras and Automata

Andrei Kelarev (Autor)

Buch | Hardcover

384 Seiten

2003
Crc Press Inc (Verlag)
978-0-8247-4708-4 (ISBN)

Artikel merken

Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra. This book defines graph algebras and reveals their applicability to automata theory. It proceeds to explore assorted monoids, semigroups, rings, codes, and other algebraic structures.

Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra. They are used to identify nontrivial connections across notions, expose conceptual properties, and mediate the application of methods from one area toward questions of the other four. After a concentrated review of the prerequisite mathematical background, Graph Algebras and Automata defines graph algebras and reveals their applicability to automata theory. It proceeds to explore assorted monoids, semigroups, rings, codes, and other algebraic structures and to outline theorems and algorithms for finite state automata and grammars.

Andrei Kelarev

Preface, 1. Preliminaries, 2. Algebraic Structures, 3. Automata and Languages, 4. Syntactic Monoids of Automata, 5. Congruences on Automata, 6. Minimal Automata, 7. Languages, 8. Tree Languages, 9. Equational Theories, 10. Groupoid Rings, 11. Dualities, Topologies, Flatness, 12. Open Problems, Appendix A. Glossary of Notation, Bibliography, Index

Erscheint lt. Verlag	8.7.2003
Reihe/Serie	Chapman & Hall/CRC Pure and Applied Mathematics
Verlagsort	Bosa Roca
Sprache	englisch
Maße	152 x 229 mm
Gewicht	566 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Algebra
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
ISBN-10	0-8247-4708-9 / 0824747089
ISBN-13	978-0-8247-4708-4 / 9780824747084
Zustand	Neuware