Minimization of visibly pushdown automata is NP-complete.
Olivier GauwinAnca MuschollMichael RaskinPublished in: Log. Methods Comput. Sci. (2020)
Keyphrases
- np complete
- np hard
- constraint satisfaction problems
- satisfiability problem
- randomly generated
- finite state
- pspace complete
- cellular automata
- model checking
- conjunctive queries
- computational complexity
- polynomial time complexity
- phase transition
- objective function
- lattice gas
- finite automata
- probabilistic automata
- polynomially solvable
- computationally complex
- finds an optimal solution
- regular expressions
- conp complete
- tree automata
- data complexity
- finite state machines
- scheduling problem