Complexity of Bifix-Free Regular Languages.

Robert Ferens Marek Szykula

Published in: CIAA (2017)

Keyphrases

regular languages
decision problems
context free languages
grammatical inference
computational complexity
worst case
regular expressions
finite automata
training data
hidden markov models
upper bound
data management
theoretical analysis
sample size
integrity constraints
data exchange