Removing Nondeterminism in Constant Height Pushdown Automata [chapter]

Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2012 Lecture Notes in Computer Science  
We study the descriptional cost of removing nondeterminism in constant height pushdown automata -i.e., pushdown automata with a built-in constant limit on the height of the pushdown. We show a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up cannot be avoided by certifying its optimality. As a direct consequence, we get that eliminating
more » ... minism in classical finite state automata is single-exponential even with the help of a constant height pushdown store.
doi:10.1007/978-3-642-31623-4_6 fatcat:5g7t466q3fdn7pegxegiplc4ma