A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Towards Alternating Automata for Graph Languages
2012
Electronic Communications of the EASST
Preserved Fulltext
In this paper we introduce alternating automata for languages of arrows of an arbitrary category, and as an instantiation thereof alternating automata for graph languages. We study some of their closure properties and compare them, with respect to expressiveness, to other methods for describing graph languages. We show, by providing several examples, that many graph properties (of graphs of bounded path width) can be naturally expressed as alternating automata.
doi:10.14279/tuj.eceasst.47.734
dblp:journals/eceasst/BrugginkHK12
fatcat:7hhw4se3eje3dacuuzeaq2lzwa