9 search results - page 1 / 2 » On the Recognizability of Arrow and Graph Languages |
GG
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
ECEASST
2010
13 years 2 months ago
2010
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
IFIPTCS
2010
13 years 2 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...
MFCS
1998
Springer
13 years 9 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...