Recognizability, hypergraph operations, and logical types

Authors:
A. Blumensath;B. Courcelle
Affiliations:
Universität Darmstadt, Fachbereich Mathematik, Darmstadt, Germany and LaBRI;LaBRI Bordeaux University, Talence cedex, France
Venue:
Information and Computation
Year:
2006

Citing 16
Cited 2

The monadic second-order logic of graphs V: on closing the gap between definability and recognizability

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
The monadic second-order logic of graphs VII: graphs as relational structures

Theoretical Computer Science - Special issue on logic and applications to computer science
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
Monadic second-order definable graph transductions: a survey

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
The monadic second order logic of graphs VI: on several representations of graphs by relational structures

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Basic notions of universal algebra for language theory and graph grammars

Theoretical Computer Science
Tree languages

Handbook of formal languages, vol. 3
Logical description of context-free graph languages

Journal of Computer and System Sciences
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
A comparison of tree transductions defined by monadic second order logic and by attribute grammars

Journal of Computer and System Sciences
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Fusion in relational structures and the verification of monadic second-order properties

Mathematical Structures in Computer Science
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
The recognizability of sets of graphs is a robust property

Theoretical Computer Science

Counting truth assignments of formulas of bounded tree-width or clique-width

Discrete Applied Mathematics
Graph operations characterizing rank-width

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.