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]

Authors

Anil Ada

This author has not been identified. Look up 'Anil Ada' in Google