Skip to main content
SpringerLink
Log in

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

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6808))

Included in the following conference series:

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.

This work was partially supported by CRUI/DAAD under the project “Programma Vigoni: Descriptional Complexity of Non-Classical Computational Models”, and by research grants VEGA 1/0035/09 and APVV-0035-10.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrenfeucht, A., Zieger, P.: Complexity measures for regular expressions. J. Computer and System Sciences 12, 134–146 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  2. Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. and Comp. 208, 385–394 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410, 3281–3289 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087–1102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  6. Kutrib, M., Malcher, A., Wotschke, D.: The Boolean closure of linear context-free languages. Acta Inf. 45, 177–191 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: IEEE 12th Symp. Switching and Automata Theory, pp. 188–191 (1971)

    Google Scholar 

  8. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comp. Sci. 125, 315–328 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, P.J. Šafárik University, Jesenná 5, 04154, Košice, Slovakia

    Zuzana Bednárová & Viliam Geffert

  2. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, via Comelico 39, 20135, Milano, Italy

    Carlo Mereghetti & Beatrice Palano

Authors
  1. Zuzana Bednárová
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viliam Geffert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carlo Mereghetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Beatrice Palano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Markus Holzer

  2. Institut für Informatik, Universität Gießen, Arndtstraße 2, 35392, Gießen, Germany

    Martin Kutrib

  3. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-22600-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22600-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22599-4

  • Online ISBN: 978-3-642-22600-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation