Login / Signup
On the Non-deterministic Communication Complexity of Regular Languages.
Anil Ada
Published in:
Developments in Language Theory (2008)
Keyphrases
</>
regular languages
decision problems
finite automata
regular expressions
grammatical inference
context free languages
machine learning
context free grammars
positive data
computational complexity
query language
context free