Vinay, V and Chandru, V (1990) The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata. In: Foundations of Software Technology and Theoretical Computer Science. Tenth Conference Proceedings, 17-19 Dec. 1990, Bangalore, India, pp. 104-114.
Full text not available from this repository. (Request a copy)Abstract
Two aspects of nondeterministic auxiliary stack automata (NAuxSA) are studied. The first is the expressibility of NAuxSA. More specifically, it is shown that the polynomial hierarchy can be characterized in terms of AuxSA with resource bounds. The second aspect is a duality relation between NAuxSA and alternating auxiliary pushdown automata (Alt-AuxPDA) connecting time bounds on the former with treesize bounds on the latter.
| Item Type: | Conference Paper |
|---|---|
| Publisher: | Springer-Verlag |
| Additional Information: | Copyright of this article belongs to Springer-Verlag. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 26 Oct 2007 |
| Last Modified: | 24 Jan 2012 07:02 |
| URI: | http://eprints.iisc.ac.in/id/eprint/11428 |
Actions (login required)
 |
View Item |
