Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
