Time and tape complexity of pushdown automaton languages

An algorithm is presented which will determine whether any string w in Σ *, of length n, is contained in a language L ⊆ Σ * defined by a two-way nondeterministic pushdown automation. This algorithm requires time n 3 when implemented on a random access computer. It requires n 4 time and n 2 tape when...

Full description

Saved in:
Bibliographic Details
Published inInformation and control Vol. 13; no. 3; pp. 186 - 206
Main Authors Aho, A.V., Hopcroft, J.E., Ullman, J.D.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.1968
Online AccessGet full text

Cover

More Information
Summary:An algorithm is presented which will determine whether any string w in Σ *, of length n, is contained in a language L ⊆ Σ * defined by a two-way nondeterministic pushdown automation. This algorithm requires time n 3 when implemented on a random access computer. It requires n 4 time and n 2 tape when implemented on a multitape Turing machine. If the pushdown automaton is deterministic, the algorithm requires n 2 time on a random access computer and n 2 log n time on a multitape Turing machine.
ISSN:0019-9958
1878-2981
DOI:10.1016/S0019-9958(68)91087-5