@Misc{duepublico_mods_00018498,
  author = 	{Bruggink Dr., H. J. Sander
		and K{\"o}nig Prof. Dr., Barbara},
  title = 	{On the recognizability of Arrow and Graph Languages},
  year = 	{2008},
  month = 	{Jul},
  day = 	{23},
  volume = 	{2008-03},
  keywords = 	{Recognizability; Graph Languages},
  abstract = 	{In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is de ned via a functor into the category of relations on sets, which can be seen as a straightforward generalization of a nite 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.},
  issn = 	{1863-8554},
  url = 	{https://duepublico2.uni-due.de/receive/duepublico_mods_00018498},
  file = 	{:https://duepublico2.uni-due.de/servlets/MCRFileNodeServlet/duepublico_derivate_00020228/techreport200803.pdf:PDF},
  language = 	{en}
}