Graph algebras and automata
Graph algebras and automata
复制标题
DOI：
10.1201/9781482276367
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
A. Kelarev
中科院分区：
文献类型：
--
作者：
A. Kelarev
图代数具有关联计算机科学、组合学、图论、运筹学和泛代数的基本概念的能力。它们用于识别概念之间的重要联系，公开概念属性，并将方法的应用从一个领域调解到其他四个领域的问题。在集中回顾了必备的数学背景之后，图代数和自动机定义了图代数，并揭示了它们对自动机理论的适用性。它继续探索分类的么半群、半群、环、码和其他代数结构，并概述有限状态自动机和文法的定理和算法。
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.