Minimization of visibly pushdown automata is NP-complete
暂无分享,去创建一个
[1] Christian Schilling,et al. Minimization of Visibly Pushdown Automata Using Partial Max-SAT , 2017, TACAS.
[2] Alexander Okhotin,et al. Complexity of input-driven pushdown automata , 2014, SIGA.
[3] Henrik Björklund,et al. The tractability frontier for NFA minimization , 2008, J. Comput. Syst. Sci..
[4] Igor Walukiewicz,et al. Minimizing Variants of Visibly Pushdown Automata , 2007, MFCS.
[5] Joachim Niehren,et al. On the minimization of XML Schemas and tree automata for unranked trees , 2007, J. Comput. Syst. Sci..
[6] Mahesh Viswanathan,et al. Minimization, Learning, and Conformance Testing of Boolean Programs , 2006, CONCUR.
[7] Mahesh Viswanathan,et al. Congruences for Visibly Pushdown Languages , 2005, ICALP.
[8] Andreas Malcher,et al. Minimizing finite automata is computationally hard , 2004, Theor. Comput. Sci..
[9] Rajeev Alur,et al. Visibly pushdown languages , 2004, STOC '04.
[10] K. Mehlhorn. Pebbling Moutain Ranges and its Application of DCFL-Recognition , 1980, ICALP.
[11] A. Muscholl,et al. On Minimization of Visibly Pushdown Automata , 2012 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .