Regulated Nondeterminism in Pushdown Automata
نویسندگان
چکیده
منابع مشابه
Regulated Nondeterminism in PDAs: The Non-Regular Case
In this paper, we discuss pushdown automata which can make a nondeterministic decision only if the pushdown content forms a string that belongs to a given control language. We prove that if the control language is linear and non-regular, then the computational power of pushdown automata regulated in this way is increased to the power of Turing machines. Naturally, from the practical point of vi...
متن کاملRegulated Nondeterminism in Pushdown Automata: The Non-Regular Case
We continue the investigation of pushdown automata which are allowed to make a nondeterministic decision if and only if their pushdown content forms a string belonging to a given control language. We prove that if the control language is linear and non-regular, then the power of pushdown automata regulated in this way is increased to the power of Turing machines. From a practical point of view,...
متن کاملRemoving Nondeterminism in Constant Height Pushdown Automata
We study the descriptional cost of removing nondeterminism in constant height pushdown automata — i.e., pushdown automata with a built-in constant limit on the height of the pushdown. We show a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up c...
متن کامل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
متن کاملMeasuring Nondeterminism in Pushdown Automata
The amount of nondeterminism that a pushdown automaton requires to recognize an input string can be measured by the minimum number of guesses that it must make to accept the string, where guesses are measured in bits of information. When this quantity is unbounded, the rate at which it grows as the length of the string increases serves as a measure of the pushdown automaton’s “rate of consumpti...
متن کامل