World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

FINITELY EXPANDABLE DEEP PDAs

    https://doi.org/10.1142/9789814317610_0009Cited by:2 (Source: Crossref)
    Abstract:

    As special cases of deep pushdown automata, we discuss finitely expandable deep pushdown automata that always contain a bounded number of non-input symbols in their pushdown stores. Based on these automata, it establishes an infinite hierarchy of language families that coincides with the hierarchy resulting from matrix grammars of finite index. Thus finitely expandable deep pushdown automata can are an automaton counterpart to these grammars. It also follows that deleting transitions do not add more power to finitely expandable deep pushdown automata. In a final section, we suggest some open problems.