Skip to main content
Conference Proceedings

The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 472 LNCS 104-114
DOI: 10.1007/3-540-53487-3_38
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Two aspects of nondeterministic auxiliary stick automata (NAnxSA) are studied in this papei. The first is regarding the expressibility of NAnxSA. Mote specifically, it is shown that the polynomial hierarchy can be characterized in terms of AnxSA with resource bounds. The second aspect is a duality relation between NAnxSA and alternating auxiliary pushdown automata (Alt-AuxPDA) connecting time bonnds on the former with treesise bounds on the latter.

Cite

CITATION STYLE

APA

Vinay, V., & Chandra, V. (1990). The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 472 LNCS, pp. 104–114). Springer Verlag. https://doi.org/10.1007/3-540-53487-3_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free