Bibliographic Details
| Title: |
Recognizability, hypergraph operations, and logical types |
| Authors: |
Blumensath, A.1 blumensath@mathematik.tu-darmstadt.de, Courcelle, B.2 courcell@labri.fr |
| Source: |
Information & Computation. Jun2006, Vol. 204 Issue 6, p853-919. 67p. |
| Subjects: |
Hypergraphs, Algebra, Mathematical analysis, Graph theory |
| Abstract: |
Abstract: We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra on relational structures is based on disjoint union and quantifier-free definable operations. We expand it to an equivalent one by adding operations definable with “few quantifiers”, i.e., operations that take into account local information about elements or tuples. We also consider monadic second-order transductions and we prove that the inverse image of a recognizable set under such a transduction is recognizable. [Copyright &y& Elsevier] |
|
Copyright of Information & Computation is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
