On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes.
Juraj HromkovicGeorg SchnitgerPublished in: Developments in Language Theory (2008)
Keyphrases
- lower bound
- upper bound
- worst case
- np hard
- branch and bound
- small number
- small size
- upper and lower bounds
- phase transition
- branch and bound algorithm
- lower and upper bounds
- objective function
- vc dimension
- regular expressions
- linear programming relaxation
- quadratic assignment problem
- linear programming
- knapsack problem
- information theoretic
- database
- computational complexity
- search algorithm
- learning algorithm
- neural network
- data sets