On the Recognizability of Arrow and Graph Languages

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.

• Type: Conference
• Year: 2008
• Where: GG
• Authors: Harrie Jan Sander Bruggink, Barbara König
• Keywords: Category-based Characterization, GG 2008, Recognizable Subset, Straightforward Generalization, Theoretical Computer Science