Sciweavers

47 search results - page 2 / 10
» On the Recognizability of Self-generating Sets
Sort
View
IANDC
2006
82views more  IANDC 2006»
13 years 5 months ago
Recognizability, hypergraph operations, and logical types
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 ...
Achim Blumensath, Bruno Courcelle
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 5 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
DLT
2004
13 years 7 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
MFCS
2009
Springer
14 years 5 days ago
On the Recognizability of Self-generating Sets
Let I be a finite set of integers and F be a finite set of maps of the form n → ki n + i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability ...
Tomi Kärki, Anne Lacroix, Michel Rigo