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, Košice, Slovakia;Department of Computer Science, P. J. Šafárik University, Košice, Slovakia;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy;Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Milano, Italy
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 7
Cited 2

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

Removing nondeterminism in constant height pushdown automata

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Descriptional complexity of pushdown store languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the size-cost of boolean operations on constant height deterministic pushdown automata. We prove an asymptotically optimal exponential blow-up for union and intersection, as well as polynomial blow-up for complement.