(2020). Minimization of visibly pushdown automata is NP-complete. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Minimization of Visibly Pushdown Automata Is NP-complete."
Logical Methods in Computer Science 2020.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Minimization of Visibly Pushdown Automata Is NP-complete."
Logical Methods in Computer Science, 2020.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.