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...

This book contains the definitions of several ring constructions used in various applications. The concept of a groupoid-graded ring includes many of these constructions as special cases and makes it possible to unify the exposition. Recent research results on groupoid-graded rings and more specialized constructions are presented. In addition, there is a chapter containing open problems currently considered in the literature.

Ring Constructions and Applications can serve as an excellent introduction for graduate students to many ring constructions as well as to essential basic concepts of...