Elsevier

Theoretical Computer Science

Volume 449, 31 August 2012, Pages 23-36
Theoretical Computer Science

The size-cost of Boolean operations on constant height deterministic pushdown automata

https://doi.org/10.1016/j.tcs.2012.05.009Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the size-cost of Boolean operations on constant height deterministic pushdown automata, i.e., on the traditional pushdown automata with a built-in constant limit on the height of the pushdown. We design a simulation showing that a complement can be obtained with a polynomial tradeoff. For intersection and union, we show an exponential simulation, and prove that the exponential blow-up cannot be avoided.

Keywords

Finite state automata
Regular languages
Pushdown automata

Cited by (0)