[1]
Bruggink, H.J.S. and Hülsbusch, M. 2011. Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages. Electronic Communications of the EASST. 41, (May 2011). DOI:https://doi.org/10.14279/tuj.eceasst.41.580.