Login / Signup
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages.
Janusz A. Brzozowski
Baiyu Li
Yuli Ye
Published in:
DCFS (2011)
Keyphrases
</>
regular languages
grammatical inference
context free languages
decision problems
context free grammars
finite automata
regular expressions
context free
data structure
worst case
natural language
context dependent
pac learning
computational complexity
finite state machines
special case
database