DOIAbstract
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time
For any fixed k, a remarkably simple single-tape Turing machine can simulate k independent counters in real time
Learning to count is not as easy as you might think. It is complex and takes place over a period of ...
International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary me...
AbstractIn this paper we study implementations of concurrent counters, which count modulo some (larg...
An oblivious 1-tape Turing machine can on-line simulate a multicounter machine in linear time and lo...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
AbstractThe main tool to obtain a tight deterministic time hierarchy for Turing machines is a new da...
machines and implementations The first definition of an abstract machine was given by Turing, in th...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractEach multitape Turing machine, of which the storage heads scan O(log n) distinct squares in ...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
The counting problem requires n asynchronous processors to assign themselves successive values. A so...
Learning to count is not as easy as you might think. It is complex and takes place over a period of ...
International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary me...
AbstractIn this paper we study implementations of concurrent counters, which count modulo some (larg...
An oblivious 1-tape Turing machine can on-line simulate a multicounter machine in linear time and lo...
An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and lo...
AbstractThe main tool to obtain a tight deterministic time hierarchy for Turing machines is a new da...
machines and implementations The first definition of an abstract machine was given by Turing, in th...
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{ti...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
AbstractEach multitape Turing machine, of which the storage heads scan O(log n) distinct squares in ...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing mach...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously...
The counting problem requires n asynchronous processors to assign themselves successive values. A so...
Learning to count is not as easy as you might think. It is complex and takes place over a period of ...
International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary me...
AbstractIn this paper we study implementations of concurrent counters, which count modulo some (larg...
Add to ORKG