Login / Signup
Complexity of Proper Suffix-Convex Regular Languages.
Corwin Sinnamon
Published in:
CoRR (2018)
Keyphrases
</>
regular languages
decision problems
grammatical inference
context free languages
regular expressions
computational complexity
worst case
database
relational databases
special case
pac learning
finite automata
positive data