Elias Tahhan-Bittar. Recursive Derivational Length Bounds for Confluent Term Rewrite Systems. In Sophie Tison, editor, Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings. Volume 2378 of Lecture Notes in Computer Science, pages 281-295, Springer, 2002. [doi]
@inproceedings{Tahhan-Bittar02,
title = {Recursive Derivational Length Bounds for Confluent Term Rewrite Systems},
author = {Elias Tahhan-Bittar},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2378/23780281.htm},
tags = {term rewriting, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Tahhan-Bittar02},
cites = {0},
citedby = {0},
pages = {281-295},
booktitle = {Rewriting Techniques and Applications, 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002, Proceedings},
editor = {Sophie Tison},
volume = {2378},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43916-1},
}