Program Schemes with Deep Pushdown Storage

Authors:
Argimiro Arratia;Iain A. Stewart
Affiliations:
Dpto. de Matemática Aplicada, Facultad de Ciencias, Universidad de Valladolid, Valladolid, Spain 47005;Department of Computer Science, Durham University, Science Labs, Durham, U.K. DH1 3LE
Venue:
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Year:
2008

Citing 9
Cited 0

Some relationships between logics of programs and complexity theory

Theoretical Computer Science
Using the Hamiltonian path operator to capture NP

Journal of Computer and System Sciences
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Even Simple Programs Are Hard To Analyze

Journal of the ACM (JACM)
Program schemes, arrays, Lindström quantifiers and zero-one laws

Theoretical Computer Science
Reduction to NP-complete problems by interpretations

Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
The Push3 execution stack and the evolution of control

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Comparative schematology

Record of the Project MAC conference on concurrent systems and parallel computation
An hierarchy between context-free and context-sensitive languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, $\mbox{NPSDS}_s$, based around assignments, while-loops and non- deterministic guessing but with access to a deep pushdown stack which, apart from having the usual push and pop instructions, also has deep-push instructions which allow elements to be pushed to stack locations deep within the stack. We syntactically define sub-classes of $\mbox{NPSDS}_s$ by restricting the occurrences of pops, pushes and deep-pushes and capture the complexity classes NPand PSPACE. Furthermore, we show that all problems accepted by program schemes of $\mbox{NPSDS}_s$ are in EXPTIME.