The classes of sequences generated by time- and space- restricted multiple counter machines are compared to the corresponding classes generated by similarly restricted multiple tape Turing machines. Special emphasis is placed on the class of sequences generable by machines which operate in real time. Real-time Turing machines are shown to be strictly more powerful than real-time counter machines. A number of questions which remain open for real-time Turing machines are settled for real-time counter machines
AbstractWe study the time relationships between several models of computation (variants of counter m...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Let U(n) be a monotone increasing function which is real-time computable, {if442-1}. Then it is poss...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractWe study remembering Turing machines, that is Turing machines with the capability to access ...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractWe study the time relationships between several models of computation (variants of counter m...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores a...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
Let U(n) be a monotone increasing function which is real-time computable, {if442-1}. Then it is poss...
AbstractFor fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾...
AbstractWe study remembering Turing machines, that is Turing machines with the capability to access ...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
AbstractWe study the time relationships between several models of computation (variants of counter m...
AbstractA Turing machine with two storage tapes cannot simulate a queue in both real-time and with a...
AbstractFor off-line one-tape Turing machines the number of tape reversals required for various comp...