815 search results - page 6 / 163 » Algebraic Recognizability of Languages |
ECEASST
2010
14 years 6 months ago
2010
89
Voted
DLT
2004
14 years 11 months ago
2004
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...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
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...
ICALP
2001
Springer
15 years 1 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
IFIPTCS
2010
14 years 7 months ago
2010
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...