Bruggink, Sander; König, Barbara:
On the recognizability of arrow and graph languages
Duisburg: DuEPublico, 2008
(Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft ; 2008-3)
2008bookOA Gold
Computer ScienceFaculty of Engineering » Computer Science and Applied Cognitive Science » Computer Science » Theoretical Computer Science
Title in English:
On the recognizability of arrow and graph languages
Author:
Bruggink, SanderUDE
LSF ID
47885
Other
connected with university
;König, BarbaraUDE
GND
1050396502
LSF ID
15982
ORCID
0000-0002-4193-2889ORCID iD
Other
connected with university
Place of publication:
Duisburg
Publisher:
DuEPublico
Year of publication:
2008
Open Access?:
OA Gold
Extent:
27
DuEPublico 1 ID
18498
URN
urn:nbn:de:hbz:465-20080723-132824-1
Language of text:
English
In Series
Technische Berichte der Abteilung für Informatik und Angewandte Kognitionswissenschaft
in:
Vol. 2008-3

Abstract in English:

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.