Graph Algebras and Automata

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. Language: English