On the Non-Deterministic Communication Complexity of Regular Languages

Anil Ada. On the Non-Deterministic Communication Complexity of Regular Languages. Int. J. Found. Comput. Sci., 21(4):479-493, 2010. [doi]

Abstract

Abstract is missing.