Pushdown automata with bounded nondeterminism and bounded ambiguity
نویسندگان
چکیده
منابع مشابه
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...
متن کامل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
متن کاملProbabilistic Automata of Bounded Ambiguity
Probabilistic automata are a computational model introduced by Michael Rabin, extending nondeterministic finite automata with probabilistic transitions. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are undecidable. In this work we focus on the emptiness problem, which asks whether a given probabilistic automaton accepts some word with pr...
متن کاملOn Bounded Exploration and Bounded Nondeterminism
This report consists of two separate parts, essentially two oversized footnotes to the article “Sequential Abstract State Machines Capture Sequential Algorithms” by Yuri Gurevich. In Chapter I, Yuri Gurevich and Tatiana Yavorskaya present and study a more abstract version of the bounded exploration postulate. In Chapter II, Tatiana Yavorskaya gives a complete form of the characterization, sketc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00267-8