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

  • Zuzana Bednárová
  • Viliam Geffert
  • Carlo Mereghetti
  • Beatrice Palano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)

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.

References

  1. 1.
    Ehrenfeucht, A., Zieger, P.: Complexity measures for regular expressions. J. Computer and System Sciences 12, 134–146 (1976)CrossRefMATHMathSciNetGoogle Scholar
  2. 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)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410, 3281–3289 (2009)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087–1102 (2003)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)MATHGoogle Scholar
  6. 6.
    Kutrib, M., Malcher, A., Wotschke, D.: The Boolean closure of linear context-free languages. Acta Inf. 45, 177–191 (2008)CrossRefMATHMathSciNetGoogle Scholar
  7. 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. 8.
    Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comp. Sci. 125, 315–328 (1994)CrossRefMATHMathSciNetGoogle Scholar

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