Counting Auxiliary Pushdown Automata and Semi-unbounded Arithmetic Circuits

Vinay, V (1991) Counting Auxiliary Pushdown Automata and Semi-unbounded Arithmetic Circuits. In: Sixth Annual Structure in Complexity Theory Conference, 1991, 30th June - 3rd July, Chicago,IL, pp. 270-284.

Preview

PDF Counting_auxiliary_pushdown.pdf Download (581kB)

Abstract

We examine various counting measures on space bounded nondeterministic auxiliary pushdown machines. Hitherto, counting measures on nondeterministic time bounded [Val 79,KST 89] and space bounded [AJ 90] machines have been studied.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	29 May 2006
Last Modified:	19 Sep 2010 04:27
URI:	http://eprints.iisc.ac.in/id/eprint/7049

Actions (login required)

View Item