Minimization of visibly pushdown automata is NP-complete

@article{Gauwin2019MinimizationOV,
  title={Minimization of visibly pushdown automata is NP-complete},
  author={Olivier Gauwin and Anca Muscholl and Michael Raskin},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.09563}
}
  • Olivier Gauwin, Anca Muscholl, Michael Raskin
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition graph, such that each language is associated with an initial state and a set of final states. We show that minimizing immersions is NP-complete, and reduce this problem to the minimization of visibly pushdown automata. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES