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

Authors:
Zuzana Bednárová;Viliam Geffert;Carlo Mereghetti;Beatrice Palano
Affiliations:
Department of Computer Science, P.J. afárik University, Jesenná 5, 04154 Koice, Slovakia;Department of Computer Science, P.J. afárik University, Jesenná 5, 04154 Koice, Slovakia;Dipartimento di Scienze dellInformazione, Università degli Studi di Milano, via Comelico 39, 20135 Milano, Italy;Dipartimento di Scienze dellInformazione, Università degli Studi di Milano, via Comelico 39, 20135 Milano, Italy
Venue:
Theoretical Computer Science
Year:
2012

Citing 7
Cited 0

The state complexities of some basic operations on regular languages

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
The Boolean closure of linear context-free languages

Acta Informatica
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Language operations with regular expressions of polynomial size

Theoretical Computer Science
Complexity measures for regular expressions

Journal of Computer and System Sciences
More concise representation of regular languages by automata and regular expressions

Information and Computation

Quantified Score

Hi-index	5.23

Visualization

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.