Prefix-Free Subsets of Regular Languages and Descriptional Complexity.

Jozef Stefan Jirásek Juraj Sebej

Published in: DCFS (2015)

Keyphrases

regular languages
decision problems
context free languages
regular expressions
finite automata
computational complexity
grammatical inference
worst case
database
pac learning
databases
query processing
hidden markov models
context free grammars