Minimization of visibly pushdown automata is NP-complete.
Olivier GauwinAnca MuschollMichael A. RaskinPublished in: CoRR (2019)
Keyphrases
- np complete
- np hard
- satisfiability problem
- randomly generated
- objective function
- constraint satisfaction problems
- computational complexity
- cellular automata
- model checking
- data complexity
- finite state
- database systems
- probabilistic automata
- pspace complete
- finite automata
- regular expressions
- phase transition
- finite state machines
- polynomial time complexity
- bounded treewidth
- np complete problems
- convex functions
- conjunctive queries
- finite state automata
- polynomially solvable
- conp complete
- hidden markov models
- finds an optimal solution
- branch and bound algorithm
- relational databases