On the recognizability of arrow and graph languages
Reference
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08. Springer, 2008. LNCS.
Abstract
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 can be seen as a straightforward generalization of a finite automaton. In the second part of the paper we apply the theory to graphs, and we show that our approach is a generalization of Courcelle's recognizable graph languages.
Suggested BibTeX entry:
@inproceedings{bk:recgraph08,
author = {H.J. Sander Bruggink and Barbara K{\"o}nig},
booktitle = {Proc. of ICGT '08},
note = {{LNCS}},
publisher = {Springer},
title = {On the recognizability of arrow and graph languages},
year = {2008}
}
