On the Non-Deterministic Communication Complexity of Regular Languages.

Published in: Int. J. Found. Comput. Sci. (2010)

Keyphrases

regular languages
grammatical inference
decision problems
regular expressions
context free languages
worst case
finite automata
computational complexity
special case
optimal solution
positive data