A01=Andrei Kelarev
advanced automata algorithms
Author_Andrei Kelarev
Category=PBF
Category=PBW
cayley
Cayley Graph
Cayley Table
combinatorial mathematics
Connected Component
Eo Eo
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
equational logic
equivalence
expression
Extended Euclidean Algorithm
Finite Semigroup
Graph Algebras
Huffman Code
Induced Subgraph
isolated
Isolated Vertex
Karnaugh Maps
Mealy Machine
minimal
Minimal Automata
Monogenic Semigroup
operations research
Parity Check Matrix
Polynom Ial
Polynomial
pushdown
Reduced Row Echelon Form
Rees Matrix Semigroup
regular
Regular Expression
relation
Row Echelon Form
RSA Cryptosystem
Standard Coding Form
syntactic monoid theory
Ta Te
tree language analysis
undirected
Undirected Graph
universal algebra
vertex
Product details
- ISBN 9780824747084
- Weight: 566g
- Dimensions: 152 x 229mm
- Publication Date: 08 Jul 2003
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
