29 search results - page 5 / 6 » On Reversible Automata |
132
Voted
MCU
1998
15 years 5 months ago
1998
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
128
Voted
WOSP
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
122
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the...
138
Voted
JAC
2008
15 years 5 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
152
Voted
TCS
2011
14 years 10 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...