Basic notions of universal algebra for language theory and graph grammars

被引：19
|
作者：
Courcelle, B
机构：
[1] Université Bordeaux I, Laboratoire d'Informatique, 33405 Talence Cedex, 351, Cours de la Libération
来源：
THEORETICAL COMPUTER SCIENCE | 1996年 / 163卷 / 1-2期
关键词：
D O I：
10.1016/0304-3975(95)00145-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper reviews the basic properties of the equational and recognizable subsets of general algebras; these sets can be seen as generalizations of the context-free and regular languages, respectively. This approach, based on Universal Algebra, facilitates the development of the theory of formal languages so as to include the description of sets of finite trees, finite graphs, finite hypergraphs, tuples of words, partially commutative words (also called traces) and other similar finite objects.
引用
收藏
页码：1 / 54
页数：54
相关论文
共 50 条
12345