Jean Berstel, Olivier Carton. On the Complexity of Hopcroft s State Minimization Algorithm. In Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu, editors, Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Volume 3317 of Lecture Notes in Computer Science, pages 35-44, Springer, 2004. [doi]
@inproceedings{BerstelC04,
title = {On the Complexity of Hopcroft s State Minimization Algorithm},
author = {Jean Berstel and Olivier Carton},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3317&spage=35},
researchr = {https://researchr.org/publication/BerstelC04},
cites = {0},
citedby = {0},
pages = {35-44},
booktitle = {Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers},
editor = {Michael Domaratzki and Alexander Okhotin and Kai Salomaa and Sheng Yu},
volume = {3317},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24318-6},
}