Abstract

A stack automaton is a pushdown automaton that can read the interior of its pushdown list without altering it. It is shown that a nondeterministic stack automation with a one-way input tape can be simulated by a deterministic linear bounded automaton. Hence, each nondeterministic one-way stack language is context sensitive.

Full Text
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