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
相关论文
共 22 条
  • [1] ALGEBRA AUTOMATA .I. PARALLEL PROGRAMMING AS A PROLEGOMENA TO CATEGORICAL APPROACH
    ARBIB, MA
    GIVEON, Y
    [J]. INFORMATION AND CONTROL, 1968, 12 (04): : 331 - &
  • [2] ARNOLD A, 1979, RAIRO-INF THEOR APPL, V13, P135
  • [3] ARNOLD A, 1978, RAIRO-INF THEOR-TH C, V12, P235
  • [4] BLOOM SL, 1991, EATCS MONOGRAPHS THE
  • [5] A KLEENE THEOREM FOR A CLASS OF PLANAR ACYCLIC GRAPHS
    BOSSUT, F
    DAUCHET, M
    WARIN, B
    [J]. INFORMATION AND COMPUTATION, 1995, 117 (02) : 251 - 265
  • [6] Recognizability of graph and pattern languages
    Bozapalidis, S
    Kalampakas, A
    [J]. ACTA INFORMATICA, 2006, 42 (8-9) : 553 - 581
  • [7] An axiomatization of graphs
    Bozapalidis, S
    Kalampakas, A
    [J]. ACTA INFORMATICA, 2004, 41 (01) : 19 - 61
  • [8] Claus V., 1971, Acta Informatica, V1, P64, DOI 10.1007/BF00264292
  • [9] EHRIG H, 1997, HDB GRAPH GRAMMARS C, V1
  • [10] AUTOMATA IN GENERAL ALGEBRAS
    EILENBERG, S
    [J]. INFORMATION AND CONTROL, 1967, 11 (04): : 452 - +
123