| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436576 | Theoretical Computer Science | 2008 | 19 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
