Skip to main content
SpringerLink
Log in

A Practical Simulation Result for Two-Way Pushdown Automata

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2016)

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

Included in the following conference series:

Abstract

The simulation of two-way deterministic and nondeterministic pushdown automata is revisited. A uniform algorithm presented herein decides on a random-access machine in linear time resp. cubic time whether a given pushdown automaton accepts a word, while the actual run of the automaton may take exponential time. The algorithm is practical since it only explores reachable configurations, simulates a class of quasi-deterministic decision problems in linear time even if the pushdown automaton is nondeterministic, and iterates over a simple work list. This is an improvement over previous simulation algorithms.

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 EPUB and 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

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Time and tape complexity of pushdown automaton languages. Inf. Control 13(3), 186–206 (1968)

    Article  MATH  Google Scholar 

  2. Amtoft-Hansen, T., Nikolajsen, T., Träff, J.L., Jones, N.D.: Experiments with implementations of two theoretical constructions. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 119–133. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  3. Christensen, N.H., Glück, R.: Offline partial evaluation can be as accurate as online partial evaluation. ACM TOPLAS 26(1), 191–220 (2004)

    Article  Google Scholar 

  4. Cook, S.A.: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18(1), 4–18 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cook, S.A.: Linear time simulation of deterministic two-way pushdown automata. In: Freiman, C.V., Griffith, J.E., Rosenfeld, J.L. (eds.) Information Processing 71, pp. 75–80. North-Holland, Amsterdam (1972)

    Google Scholar 

  6. Glück, R.: A self-applicable online partial evaluator for recursive flowchart languages. Softw. Pract. Experience 42(6), 649–673 (2012)

    Article  Google Scholar 

  7. Glück, R.: Simulation of two-way pushdown automata revisited. Electron. Proc. Theor. Comput. Sci. 129, 250–258 (2013)

    Article  Google Scholar 

  8. Glück, R.: Maximally-polyvariant partial evaluation in polynomial time. In: Mazzara, M., Voronkov, A. (eds.) Perspectives of System Informatics. LNCS, vol. 9609, pp. 149–157. Springer, Heidelberg (2016)

    Google Scholar 

  9. Grune, D., Jacobs, C.J.H.: Parsing Techniques: A Practical Guide. Monographs in Computer Science, 2nd edn. Springer, New York (2008)

    MATH  Google Scholar 

  10. Jones, N.D.: A note on linear time simulation of deterministic two-way pushdown automata. Inf. Process. Lett. 6(4), 110–112 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Upper Saddle River (1993)

    MATH  Google Scholar 

  12. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rytter, W.: A simulation result for two-way pushdown automata. Inf. Process. Lett. 16(4), 199–202 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rytter, W.: Fast recognition of pushdown automaton and context-free languages. Inf. Control 67(1–3), 12–22 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston (1986)

    Book  Google Scholar 

Download references

Acknowledgments

The author would like to thank Chung-chieh Shan and the anonymous reviewers for their input. It is a great pleasure to thank Akihiko Takano for providing the author with excellent working conditions at the National Institute of Informatics, Tokyo, and Masami Hagiya, Zhenjiang Hu, and Kanae Tsushima for their invaluable support in Japan.

Author information

Authors and Affiliations

  1. DIKU, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark

    Robert Glück

Authors
  1. Robert Glück
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Yonsei University, Seoul, Korea (Republic of)

    Yo-Sub Han

  2. Queen's University , Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Glück, R. (2016). A Practical Simulation Result for Two-Way Pushdown Automata. In: Han, YS., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2016. Lecture Notes in Computer Science(), vol 9705. Springer, Cham. https://doi.org/10.1007/978-3-319-40946-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40946-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40945-0

  • Online ISBN: 978-3-319-40946-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation