Bruggink, H. J. Sander, and Mathias Hülsbusch. 2011. “Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages”. Electronic Communications of the EASST 41 (May). https://doi.org/10.14279/tuj.eceasst.41.580.