The tractability frontier for NFA minimization.
Henrik BjörklundWim MartensPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- objective function
- constraint satisfaction
- np complete
- deterministic finite automata
- finite state automata
- computational complexity
- machine learning
- regular expressions
- information retrieval
- artificial neural networks
- relational databases
- support vector
- image processing
- regularization term
- string matching
- geometric interpretation
- data sets
- global minimization