Fast recognitions of pushdown automaton and context-free languages

  • Wojciech Rytter
Communications
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 176)

Abstract

We prove: 1) every language accepted by two-way nondeterministic pushdown automaton can be recognized on RAM in O(n3/log n) time; 2) every language accepted by two-way loop-free pushdown automaton can be recognized in O(n3/log2n) time; 3) every context-free language can be recognized on-line in O(n3/log2n) time. We improve the results of [1,7,4].

Keywords

Time Complexity Turing Machine Input Word Operation Insert Pushdown Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman. "Time and tape complexity of pushdown automaton languages. Information and Control 13(1968) 186–206Google Scholar
  2. [2]
    R. Bird. "Tabulation techniques for recursive programs". ACM. Computing Surveys 12(4) (1980)Google Scholar
  3. [3]
    Z. Galil. "Two fast simulations which imply some fast string matching and palindrom recognition algorithms. Inf.Proc.Letters 4(1976) 85–87Google Scholar
  4. [4]
    S. Graham, M.Harrison, and W.Ruzzo. "On-line context-free recognition in less than cubic time". 8th ACM Symp. on the Theory of Computing (1976)Google Scholar
  5. [5]
    S. Graham, and M. Harrison. "Parsing of general context-free languages" Advances in Computers 14 (1976) 77–185Google Scholar
  6. [6]
    M. Harrison. "Introduction to formal language theory". Chapter 12. Addison-Wesley (1978)Google Scholar
  7. [7]
    W. Rytter. "Time complexity of loop-free two-way pushdown automata". Inf.Proc.Letters 16 (1983) 127–129Google Scholar
  8. [8]
    W. Rytter. "A note on two-way nondeterministic pushdown automata". Inf.Proc.Letters 15 (1982) 5–9Google Scholar
  9. [9]
    W. Rytter. "Time complexity of unambiguous path systems". Inf.Proc.Letters 15 (1982) 102–104Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Wojciech Rytter
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarszawaPoland

Personalised recommendations