Alternation bounded auxiliary pushdown automata
نویسندگان
چکیده
منابع مشابه
Bounded-oscillation Pushdown Automata
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating behavior of the stack along the run. We study languages accepted by pushdown automata restricted to k-oscillating runs. We relate oscillation on pushdo...
متن کاملPushdown Automata with Reversal-Bounded Counters
The main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bounded counters can be simulated by a Turing machine in time polynomial in n”’ + R(n) if M is 2-way, and in time polynomial in n + R(n) if M is l-way. It follows from this and previous results that for sufficiently large R(n), the addition of a pushdown store to R(n) reversal-bounded multicounter machines...
متن کاملCounting Auxiliary Pushdown Automata and Semi-unbounded Arithmetic Circuits
In the main theorem, we show 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. Our techniques simulate the NAuxPDA in novel way by considering the height and reversal bounds of an AuxPDA. Reversal bounded AuxPDA have been studied previously [B...
متن کاملCharacterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
An alternating auxiliary pushdown hierarchy is defined by extending the machine model of the Logarithmic Alternation Hierarchy by a pushdown store while keeping a polynomial time bound. Although recently it was proven by Borodin et al. that the class of languages accepted by nondeterministic logarithmic space bounded auxiUary pushdown automata with a polynomial time bound is closed under comple...
متن کاملSymmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata1
We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC 1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. Keywords-Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80029-7