The influence of the machine model on the time complexity of context-free language recognition
It is shown that the assumption of a RAM model with "unit cost criterion" in the case of context-free language recognition leads to time bounds significantly better than the well-known bounds of O(n3) or O(n2.81). Even a RAM with the usual arithmetic operations (+,−) only allows some kind of time-saving set manipulations such that general context-free language recognition can be performed in O(n2.log n) steps, provided that a unit cost criterion is assumed.
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Co., Reading, Mass., 1974Google Scholar
- 2.Cook, S.A., and Reckhow, R.A., Time-Bounded Random Access Machines. Journal of Computer and System Sciences, 7 (1973), 354–375Google Scholar
- 4.Graham, S.L., and Harrison, M.A., Parsing of General Context-Free Languages. In: Advances in Computers, vol. 14 (Ed.: Rubinoff, M., and Yovits, M.C.), pp. 77–185. Academic Press, New York, 1976Google Scholar
- 5.Graham, S.L., Harrison, M.A., and Ruzzo, W.L., On Line Context Free Language Recognition in Less Than Cubic Time. Eighth Annual ACM Symposium on Theory of Computing (1976), 112–120Google Scholar
- 6.Hartmanis, J., and Simon, J., On the Power of Multiplication in Random Access Machines. 15th Annual Symposium on Switching and Automata Theory (1974), 13–23Google Scholar
- 8.Kosaraju, S.R., Recognition of Context-Free Languages by Random Access Machines. Manuscript, 1976Google Scholar
- 9.Pratt, V.R., and Stockmeyer, L.J., A Characterization of the Power of Vector Machines. Journal of Computer and System Sciences, 12 (1976), 198–221Google Scholar
- 10.Seiferas, J.I., and Weicker, R., Linear-Time Simulation of an Iterative Array of Finite-State Machines by a RAM with Uniform Cost Criterion. Technical Report No. 201, The Pennsylvania State University, Computer Science Dept., July 1976Google Scholar