✦ LIBER ✦

Efficient exhaustive listings of reversible one dimensional cellular automata

✍ Scribed by Tim Boykett

Book ID: 108280967
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 368 KB
Volume: 325
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.06.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reversible simulation of one-dimensional

Reversible simulation of one-dimensional irreversible cellular automata

✍ Kenichi Morita 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Procedures for calculating reversible on

Procedures for calculating reversible one-dimensional cellular automata

✍ Juan Carlos Seck Tuoh Mora; Sergio V. Chapa Vergara; Genaro Juárez Martínez; Har 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Computation-universality of one-dimensio

Computation-universality of one-dimensional one-way reversible cellular automata

✍ Kenichi Morita 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Efficient constant speed-up for one dime

Efficient constant speed-up for one dimensional cellular automata calculators

✍ Olivier Heen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 558 KB

One-dimensional cellular automata (CA) can be used as function calculators: starting from an input word, an output configuration is reached, where the result is written on all cells. The constant speed-up theorem for this model was first established by C. Choffrut and K. Culik, but an exponential gr

Simulating reversible Turing machines an

Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata

✍ Kenichi Morita 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 974 KB

A numerical study of one-dimensional cel

A numerical study of one-dimensional cellular automata

✍ A. Sinha; C. Jayaprakash 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 964 KB