On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA s

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]

Abstract

Abstract is missing.