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].
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, and J. Ullman. "Time and tape complexity of pushdown automaton languages. Information and Control 13(1968) 186–206
R. Bird. "Tabulation techniques for recursive programs". ACM. Computing Surveys 12(4) (1980)
Z. Galil. "Two fast simulations which imply some fast string matching and palindrom recognition algorithms. Inf.Proc.Letters 4(1976) 85–87
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)
S. Graham, and M. Harrison. "Parsing of general context-free languages" Advances in Computers 14 (1976) 77–185
M. Harrison. "Introduction to formal language theory". Chapter 12. Addison-Wesley (1978)
W. Rytter. "Time complexity of loop-free two-way pushdown automata". Inf.Proc.Letters 16 (1983) 127–129
W. Rytter. "A note on two-way nondeterministic pushdown automata". Inf.Proc.Letters 15 (1982) 5–9
W. Rytter. "Time complexity of unambiguous path systems". Inf.Proc.Letters 15 (1982) 102–104
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rytter, W. (1984). Fast recognitions of pushdown automaton and context-free languages. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030334
Download citation
DOI: https://doi.org/10.1007/BFb0030334
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive