Login / Signup
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages.
Janusz A. Brzozowski
Galina Jirásková
Baiyu Li
Joshua Smith
Published in:
AFL (2011)
Keyphrases
</>
regular languages
decision problems
context free languages
grammatical inference
regular expressions
finite automata
computational complexity
worst case
n gram
knowledge base
np hard
model selection
positive data