Skip to main content
SpringerLink
Log in

Simplifying DPDA Using Supplementary Information

  • Conference paper
Language and Automata Theory and Applications (LATA 2011)

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

Abstract

We study the effect of using supplementary information on the complexity of deterministic pushdown automata. This continues the study of assisted problem solving initiated in [Gaži, Rovan 2008]. We study deterministic PDA that can assume its input to be in a given regular advisory language. We first show that no suitable complexity measure for DPDA combining the number of states and stack symbols exists. Next we prove tight bounds on the state complexity of an infinite sequence of deterministic context-free languages and show that no supplementary regular information can decrease the state complexity of the DPDA recognizing them. We also find an infinite sequence of deterministic context-free languages for which a suitable supplementary regular information enables the construction of a significantly simpler DPDA.

This research was supported in part by the grant VEGA 1/0726/09.

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. Gaži, P., Rovan, B.: Assisted problem solving and decompositions of finite automata. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 292–303. Springer, Heidelberg (2008)

    Google Scholar 

  2. Gécseg, F.: Products of Automata. Springer, Berlin (1986)

    Book  MATH  Google Scholar 

  3. Gécseg, F., Peák, I.: Algebraic Theory of Automata. Akadémiai Kiadó, Budapest (1972)

    MATH  Google Scholar 

  4. Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM 22(1), 1–10 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Bratislava, Slovakia

    Pavel Labath & Branislav Rovan

Authors
  1. Pavel Labath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Branislav Rovan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Department of Informatics, Kyushu University, 744 Motooka, 819–0395, Fukuoka, Japan

    Shunsuke Inenaga

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Labath, P., Rovan, B. (2011). Simplifying DPDA Using Supplementary Information. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21254-3_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21253-6

  • Online ISBN: 978-3-642-21254-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation