Most Complex Deterministic Union-Free Regular Languages.

Janusz A. Brzozowski Sylvie Davies

Published in: CoRR (2017)

Keyphrases

regular languages
grammatical inference
regular expressions
context free grammars
context free languages
training data
special case
upper bound
context sensitive
finite automata