Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height


We study the size-cost of Boolean operations on constant height nondeterministic pushdown automata, i.e. on pushdown automata with a constant limit on the size of the pushdown. For intersection, we show an exponential simulation and prove that the exponential blowup is necessary. For union, instead, we provide a linear trade-off while, for complement, we… (More)
DOI: 10.1007/978-3-642-38536-0_9


4 Figures and Tables

Slides referencing similar topics