Login / Signup
Complete Classifications for the Communication Complexity of Regular Languages.
Pascal Tesson
Denis Thérien
Published in:
Theory Comput. Syst. (2005)
Keyphrases
</>
regular languages
decision problems
context free languages
grammatical inference
finite automata
regular expressions
computational complexity
worst case
positive data
object oriented
context free grammars
decision trees
semi supervised