Graph Algebras and Automata

1. Auflage 2003
ISBN: 978-0-8247-4708-4
Verlag: Taylor & Francis Inc

Buch, Englisch, 384 Seiten, Format (B × H): 216 mm x 279 mm, Gewicht: 635 g

Reihe: Chapman & Hall/CRC Pure and Applied Mathematics

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.

Zielgruppe

Professional

Autoren/Hrsg.

Kelarev, Andrei

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Algebra Homologische Algebra
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik

Inhaltsverzeichnis

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

Über Autor(innen)

Andrei Kelarev