Hermann Gruber, Markus Holzer. Finding Lower Bounds for Nondeterministic State Complexity Is Hard. In Oscar H. Ibarra, Zhe Dang, editors, Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings. Volume 4036 of Lecture Notes in Computer Science, pages 363-374, Springer, 2006. [doi]
@inproceedings{GruberH06:1,
title = {Finding Lower Bounds for Nondeterministic State Complexity Is Hard},
author = {Hermann Gruber and Markus Holzer},
year = {2006},
doi = {10.1007/11779148_33},
url = {http://dx.doi.org/10.1007/11779148_33},
researchr = {https://researchr.org/publication/GruberH06%3A1},
cites = {0},
citedby = {0},
pages = {363-374},
booktitle = {Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings},
editor = {Oscar H. Ibarra and Zhe Dang},
volume = {4036},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-35428-X},
}