The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata

  • Zuzana Bednárová
  • Viliam Geffert
  • Carlo Mereghetti
  • Beatrice Palano
Conference paper

DOI: 10.1007/978-3-642-22600-7_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Bednárová Z., Geffert V., Mereghetti C., Palano B. (2011) The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

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.

Keywords

pushdown automata boolean operations on languages descriptional complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Zuzana Bednárová
    • 1
  • Viliam Geffert
    • 1
  • Carlo Mereghetti
    • 2
  • Beatrice Palano
    • 2
  1. 1.Department of Computer ScienceP.J. Šafárik UniversityKošiceSlovakia
  2. 2.Dipartimento di Scienze dell’InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations