✦ LIBER ✦

Intractable problems in reversible cellular automata

✍ Scribed by Farrokh Vatan

Publisher: Springer
Year: 1988
Tongue: English
Weight: 637 KB
Volume: 27
Category: Article
ISSN: 0020-7748
DOI: 10.1007/bf00669293

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Firing squad synchronization problem in

Firing squad synchronization problem in reversible cellular automata

✍ Katsunobu Imai; Kenichi Morita 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Relaxation properties of elementary reve

Relaxation properties of elementary reversible cellular automata

✍ Shinji Takesue 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Reversible space–time simulation of cell

Reversible space–time simulation of cellular automata

✍ Jérôme O. Durand-Lose 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 276 KB

The goal of this paper is to design a reversible d-dimensional cellular automaton which is capable of simulating the behavior of any given d-dimensional cellular automaton over any given conÿguration (even inÿnite) with respect to a well suited notion of simulation we introduce. We generalize a prob

Intractability of decision problems for

Intractability of decision problems for finite-memory automata

✍ Hiroshi Sakamoto; Daisuke Ikeda 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 145 KB

This paper deals with ÿnite-memory automata, introduced in Kaminski and Francez (Theoret. Comput. Sci. 134 (1994) 329-363). With a restricted memory structure that consists of a ÿnite number of registers, a ÿnite-memory automaton can store arbitrary input symbols. Thus, the language accepted by a ÿn

Boltzmann-type equations for elementary

Boltzmann-type equations for elementary reversible cellular automata

✍ S. Takesue 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 565 KB

A Boltzmann-type equation is introduced as an approximation for calculating the time evolution of the probability distribution in elementary reversible cellular automata. A number of properties are discussed from the approximation. Applications to heat conduction problem are exhibited. Simulation re

The set of reversible 90150 cellular aut

The set of reversible 90150 cellular automata is regular

✍ Palash Sarkar; Rana Barua 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 869 KB

The reversibility problem for 90/150 cellular automata (both null and periodic boundary) is tackled using continua& and regular expressions. A 90/150 cellular automata can be uniquely encoded by a string over the alphabet (0, 1). It is shown that the set of strings which correspond to reversible 90/