Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.
Alexandros PalioudakisKai SalomaaSelim G. AklPublished in: J. Autom. Lang. Comb. (2014)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- objective function
- branch and bound algorithm
- np hard
- branch and bound
- upper and lower bounds
- worst case
- optimal solution
- lower bounding
- situation calculus
- regular expressions
- finite state automata
- finite automata
- competitive ratio
- finite number
- string matching
- lagrangian relaxation
- constant factor
- data sets
- deterministic finite automata
- planning problems
- query processing
- learning algorithm
- genetic algorithm