Skip to main content
SpringerLink
Log in

Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height

  • Conference paper
Computer Science – Theory and Applications (CSR 2013)

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

Included in the following conference series:

Abstract

We study the size-cost of Boolean operations on constant height nondeterministic pushdown automata, i.e. on pushdown automata with a constant limit on the size of the pushdown. For intersection, we show an exponential simulation and prove that the exponential blow-up is necessary. For union, instead, we provide a linear trade-off while, for complement, we show a double-exponential simulation and prove a single-exponential lower bound.

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. Bednárová, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 76–88. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Bednárová, Z., Geffert, V., Mereghetti, C., Palano, B.: The size-cost of Boolean operations on constant height deterministic pushdown automata. Theoret. Comput. Sci. 449, 23–36 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ehrenfeucht, A., Zieger, P.: Complexity measures for regular expressions. J. Comput. System Sci. 12, 134–146 (1976)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Holzer, M., Kutrib, M.: Descriptional complexity — an introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press (2010)

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Meyer, A., Fischer, M.: Economy of description by automata, grammars, and formal systems. In: Proc. IEEE Symp. Switching & Automata Th., pp. 188–191 (1971)

    Google Scholar 

  10. Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal’s function. Internat. J. Found. Comput. Sci. 13, 145–159 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  12. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer (1997)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. Computer Sci., P. J. Šafárik Univ., Jesenná 5, 04154, Košice, Slovakia

    Viliam Geffert & Zuzana Bednárová

  2. Dip. Informatica, Univ. degli Studi di Milano, v. Comelico 39, 20135, Milano, Italy

    Carlo Mereghetti & Beatrice Palano

Authors
  1. Viliam Geffert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zuzana Bednárová
    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. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Andrei A. Bulatov

  2. Institute of Mathematics and Computer Science, Ural Federal University, 51 Lenina Ave., 620083, Ekaterinburg, Russia

    Arseny M. Shur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geffert, V., Bednárová, Z., Mereghetti, C., Palano, B. (2013). Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38536-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38535-3

  • Online ISBN: 978-3-642-38536-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation