Abstract
In this paper we introduce a new model of stack automata, the so-called tree-stack automata, where the linear stack is extended to a tree-stack. A main subject of our investigations is to explore the relationship between tree-stack automata and stack automata. The recognition power of the one-way tree-stack automata is more powerful than the recognition power of (linear) stack automata. On the other hand two-way tree-stack automata have the same recognition power as two-way (linear) stack automata. We show the equivalence of tree-stack automata and one-way stack-pushdown machines of [EnMSvL]. From this equivalence follows that one-way tree-stack automata are more powerful than (linear) one-way stack automata and that they have an interesting grammatical characterization by Extended Basic grammars. Therefore closure properties for the class of accepting languages of one-way tree-stack automata can be derived.
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.
