Efficient determinization of visibly and height-deterministic pushdown automata

摘要

New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented. The algorithms improve the results of existing algorithms. They construct only accessible states and necessary pushdown symbols of the resulting deterministic pushdown automata. (C) 2016 Elsevier Ltd. All rights reserved.