Pascal Tesson, Denis Thérien. Complete Classifications for the Communication Complexity of Regular Languages. In Helmut Alt, Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Volume 2607 of Lecture Notes in Computer Science, pages 62-73, Springer, 2003. [doi]
@inproceedings{TessonT03,
title = {Complete Classifications for the Communication Complexity of Regular Languages},
author = {Pascal Tesson and Denis Thérien},
year = {2003},
url = {http://link.springer.de/link/service/series/0558/bibs/2607/26070062.htm},
tags = {completeness, classification, Pascal},
researchr = {https://researchr.org/publication/TessonT03},
cites = {0},
citedby = {0},
pages = {62-73},
booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
editor = {Helmut Alt and Michel Habib},
volume = {2607},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00623-0},
}