Login / Signup
Non-Deterministic Communication Complexity of Regular Languages
Anil Ada
Published in:
CoRR (2008)
Keyphrases
</>
regular languages
decision problems
grammatical inference
regular expressions
context free languages
computational complexity
finite state machines
context free grammars
pac learning
machine learning
np hard
upper bound
finite automata