Title :
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
fDate :
30 Jun-3 Jul 1991
Abstract :
The author examines various counting measures on space bounded nondeterministic auxiliary pushdown machines. In the main theorem, it is shown how a NAuxPDA may be simulated efficiently by a uniform family of Boolean circuits, which preserve the number of accepting paths in the NAuxPDA as the number of accepting subtrees in the Boolean circuit. The techniques used simulate the NAuxPDA in a novel way by considering the height and reversal bounds of an AuxPDA. One of the highlights of the present work is an exact characterization of the important class DET . It is shown that DET is exactly the class of functions that can be computed as the difference between the outputs of two counting logspace machines
Keywords :
Boolean functions; computational complexity; digital arithmetic; finite automata; Boolean circuits; DET; NAuxPDA; accepting paths; accepting subtrees; auxiliary pushdown automata; counting logspace machines; height bounds; nondeterministic auxiliary pushdown machines; reversal bounds; semi-unbounded arithmetic circuits; space bounded; Automata; Automation; Circuit simulation; Complexity theory; Computer science; Digital arithmetic; Extraterrestrial measurements; Polynomials; Time measurement;
Conference_Titel :
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2255-5
DOI :
10.1109/SCT.1991.160269