Franz-Josef Brandenburg, Konstantin Skodinis. Finite graph automata for linear and boundary graph languages. Theoretical Computer Science, 332(1-3):199-232, 2005. [doi]
@article{BrandenburgS05,
title = {Finite graph automata for linear and boundary graph languages},
author = {Franz-Josef Brandenburg and Konstantin Skodinis},
year = {2005},
doi = {10.1016/j.tcs.2004.09.040},
url = {http://dx.doi.org/10.1016/j.tcs.2004.09.040},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BrandenburgS05},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {332},
number = {1-3},
pages = {199-232},
}