| Graph Algebras and Automata Contributor(s): Kelarev, Andrei (Author) |
|
 |
ISBN: 0824747089 ISBN-13: 9780824747084 Publisher: CRC Press OUR PRICE: $332.50 Product Type: Hardcover - Other Formats Published: July 2003 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Applied - Medical - Mathematics | Combinatorics |
| Dewey: 512 |
| LCCN: 2003273613 |
| Series: Pure and Applied Mathematics (M. Dekker) |
| Physical Information: 0.9" H x 6.24" W x 9.08" (1.39 lbs) 384 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |