Graph automata

被引：19
|
作者：
Bozapalidis, Symeon [1 ]
Kalampakas, Antonios [1 ]
机构：
[1] Aristotle Univ Thessaloniki, Dept Math, Thessaloniki 54124, Greece
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 393卷 / 1-3期
关键词：
automata; directed hypergraphs; magmoids;
D O I：
10.1016/j.tcs.2007.11.022
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Magmoids satisfying the 15 fundamental equations of graphs, namely graphoids, are introduced. Automata on directed hypergraphs are defined by virtue of a relational graphoid. The closure properties of the so-obtained class are investigated, and a comparison is being made with the class of syntactically recognizable graph languages. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：147 / 165
页数：19
相关论文
共 50 条
12345