Abstract
In this paper, a new type of automation, called a two-way pushdown automaton is defined and studied. The model is a generalization of a pushdown automaton in that two-way motion is allowed on the input tape which is assumed to have endmarkers. The model is investigated in both the nondeterministic and deterministic cases. A number of basic results are obtained which include relationships with other families, closure and nonclosure results, and decidability properties. Certain special cases are studied such as the cases when the input alphabet has one letter and the device has no endmarkers.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
