AbstractA reset tape has one read-write head which moves only left-to-right except that the head can be reset once to the left end and the tape rescanned; a multiple-reset machine has reset tapes as auxiliary storage and a one-way input tape. Linear time is no more powerful than real time for nondeterministic multiple-reset machines and so the family MULTI-RESET of languages accepted in real time by nondeterministic multiple-reset machines is closed under linear erasing. MULTI-RESET is closed under Kleene. It can be characterized as the smallest family of languages containing the regular sets and closed under intersection and linear-erasing homomorphic duplication or as the smallest intersection-closed semiAFL containing COPY = {ww | w in {...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
AbstractWe study the power of reversal-bounded ATMs (alternating Turing machines). The results obtai...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractYamamoto and Noguchi raised the question of whether every recursively enumerable set can be ...
The different concepts involved in “reversal complexity”counting reversals (sweeps), visits to a squ...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
AbstractWe prove that DLOG is equal to the class of languages recognized by deterministic reversal-b...
AbstractIt is known that, for one-tape nondeterministic Turing machines, S(n)-space and S(n)-reversa...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
AbstractWe study the power of reversal-bounded ATMs (alternating Turing machines). The results obtai...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...
AbstractYamamoto and Noguchi raised the question of whether every recursively enumerable set can be ...
The different concepts involved in “reversal complexity”counting reversals (sweeps), visits to a squ...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
AbstractWe prove that DLOG is equal to the class of languages recognized by deterministic reversal-b...
AbstractIt is known that, for one-tape nondeterministic Turing machines, S(n)-space and S(n)-reversa...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
AbstractWe study the power of reversal-bounded ATMs (alternating Turing machines). The results obtai...
AbstractWe consider one-tape nondeterministic Turing machines, i.e. with a unique worktape on which ...