Complete Classifications for the Communication Complexity of Regular Languages.

Pascal Tesson Denis Thérien

Published in: STACS (2003)

Keyphrases

regular languages
decision problems
regular expressions
context free languages
grammatical inference
finite automata
computational complexity
database
semi supervised
optimal policy
integrity constraints
boolean functions
context free grammars