Juraj Hromkovic, Holger Petersen, Georg Schnitger. On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA s. Theoretical Computer Science, 410(30-32):2972-2981, 2009. [doi]
@article{HromkovicPS09,
title = {On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA s},
author = {Juraj Hromkovic and Holger Petersen and Georg Schnitger},
year = {2009},
doi = {10.1016/j.tcs.2009.03.020},
url = {http://dx.doi.org/10.1016/j.tcs.2009.03.020},
researchr = {https://researchr.org/publication/HromkovicPS09},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {30-32},
pages = {2972-2981},
}