[1]
Bruggink, H.S. et al. 2012. Towards Alternating Automata for Graph Languages.
Electronic Communications of the EASST
. 47, (Jul. 2012). DOI:https://doi.org/10.14279/tuj.eceasst.47.734.