Alfons Geser, Dieter Hofbauer, Johannes Waldmann. Match-Bounded String Rewriting Systems. In Branislav Rovan, Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. Volume 2747 of Lecture Notes in Computer Science, pages 449-459, Springer, 2003. [doi]
@inproceedings{GeserHW03,
title = {Match-Bounded String Rewriting Systems},
author = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2747&spage=449},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GeserHW03},
cites = {0},
citedby = {0},
pages = {449-459},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings},
editor = {Branislav Rovan and Peter Vojtás},
volume = {2747},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40671-9},
}