A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton.
Michael A. RaskinPublished in: CoRR (2017)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- lower bounding
- upper and lower bounds
- randomized algorithms
- branch and bound
- running times
- branch and bound algorithm
- np hard
- deterministic finite automata
- optimal solution
- finite state automaton
- computational complexity
- objective function
- data sets
- space complexity
- black box
- reinforcement learning
- database