## Graph Algebras and AutomataGraph 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

accepted addition Alg(D algorithm alphabet assume automata automaton belongs binary called Cayley codewords column complete Compute congruence consider consists contains defined definition denoted diagram direct distinct divides edges elements encoding equal equations equivalence equivalence relation Example Exercise exists field Figure Find finite function given graph algebra groupoid Hence holds homomorphism ideal identity implies in-closed In(a induced introduce isomorphic labeled language lattice Lemma length letters linear mapping matrix means minimal monoid multiplication operations pair permutation polynomial positive integers Proof properties Prove recognized regular expression respect ring satisfies Second semigroup shows Solution space Step subgraph subset Suppose symbols syntactic terminal Theorem Theory transition undirected graph union variety vectors verify vertex vertices walk write zero