Didier Caucal, Teodor Knapik. A Chomsky-Like Hierarchy of Infinite Graphs. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 177-187, Springer, 2002. [doi]
@inproceedings{CaucalK02,
title = {A Chomsky-Like Hierarchy of Infinite Graphs},
author = {Didier Caucal and Teodor Knapik},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2420/24200177.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CaucalK02},
cites = {0},
citedby = {0},
pages = {177-187},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
editor = {Krzysztof Diks and Wojciech Rytter},
volume = {2420},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44040-2},
}