VOLUME 7 | 2002 | NUMBER 4 |
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds
on the Size of Minimal Nondeterministic Finite Automata
Pages 419–432
Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2002-419, author = {Henry N. Adorna}, title = {3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata}, journal = {Journal of Automata, Languages and Combinatorics}, volume = {7}, number = {4}, pages = {419--432}, year = {2002}, url = {https://doi.org/10.25596/jalc-2002-419}, doi = {10.25596/jalc-2002-419} }