International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary memory. It is known that CM(k) are universal for \\k\backslashge 2\\ . As shown by Morita reversible CM(2) are universal. Based on results from Korec we construct four small universal reversible counter machines highlighting different trade-offs: (10, 109, 129), (11, 227, 270), (9, 97, 116) and (2, 1097, 1568), where in parentheses we indicated the number of counters, states and instructions, respectively. Since counter machines are used in many areas, our results can be the starting point for corresponding reversible universal constructions
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
AbstractWe study various generalizations of reversal-bounded multicounter machines and show that the...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary me...
AbstractA k-counter machine (CM(k)) is an automaton having k counters as an auxiliary memory. It has...
A reversible cellular automaton (RCA) is regarded as a mathematical model for spatiotemporal phenome...
We study the problem of designing small universal reversible Turing machines (URTMs). So far, six ki...
Abstract We consider stateless counter machines which mix the features of one-head counter machines ...
In this paper, we introduce a 4 4 -state two-dimensional reversible cellular automaton called P 4 ...
The two main results of the paper are: (1) proving a fine hierarchy of reversal-bounded counter mach...
AbstractThe main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bo...
Abstract. We study various generalizations of reversal-bounded multicounter machines and show that t...
Abstract. We extend the class of reversal-bounded counter machines by autho-rizing a finite number o...
International audienceWe prove the equivalence of two classes of counter machines and one class of d...
Reversible computing is a paradigm of computation that reflects physical reversibility, one of the f...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
AbstractWe study various generalizations of reversal-bounded multicounter machines and show that the...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
International audienceA k-counter machine (CM(k)) is an automaton with k counters as an auxiliary me...
AbstractA k-counter machine (CM(k)) is an automaton having k counters as an auxiliary memory. It has...
A reversible cellular automaton (RCA) is regarded as a mathematical model for spatiotemporal phenome...
We study the problem of designing small universal reversible Turing machines (URTMs). So far, six ki...
Abstract We consider stateless counter machines which mix the features of one-head counter machines ...
In this paper, we introduce a 4 4 -state two-dimensional reversible cellular automaton called P 4 ...
The two main results of the paper are: (1) proving a fine hierarchy of reversal-bounded counter mach...
AbstractThe main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bo...
Abstract. We study various generalizations of reversal-bounded multicounter machines and show that t...
Abstract. We extend the class of reversal-bounded counter machines by autho-rizing a finite number o...
International audienceWe prove the equivalence of two classes of counter machines and one class of d...
Reversible computing is a paradigm of computation that reflects physical reversibility, one of the f...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
AbstractWe study various generalizations of reversal-bounded multicounter machines and show that the...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...