Full Text Documents

Search


Table of Contents
Cellular Automata and Discrete Complex Systems
Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca
Front Matter

Invited Papers


Strict Asymptotic Nilpotency in Cellular Automata
Ville Salo
3-15

Regular Papers


Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties
Marcella Anselmo, Dora Giammarresi, Maria Madonia
19-31
Restricted Binary Strings and Generalized Fibonacci Numbers
Antonio Bernini
32-43
Von Neumann Regular Cellular Automata
Alonso Castillo-Ramirez, Maximilien Gadouleau
44-55
Enumerative Results on the Schröder Pattern Poset
Lapo Cioni, Luca Ferrari
56-67
Canonical Form of Gray Codes in N-cubes
Sylvain Contassot-Vivier, Jean-François Couchot
68-80
Equicontinuity and Sensitivity of Nondeterministic Cellular Automata
Pietro Di Lena
81-96
Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules
Nazim Fatès
97-108
On the Computational Complexity of the Freezing Non-strict Majority Automata
Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger
109-119
Distortion in One-Head Machines and Cellular Automata
Pierre Guillon, Ville Salo
120-138
Fast One-Way Cellular Automata with Reversible Mealy Cells
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
139-150
Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata
Luca Mariot, Enrico Formenti, Alberto Leporati
151-164
Filling Curves Constructed in Cellular Automata with Aperiodic Tiling
Gaétan Richard
165-175
Some Computational Limits of Trellis Automata
Véronique Terrier
176-186
Turing-Completeness of Asynchronous Non-camouflage Cellular Automata
Tatsuya Yamashita, Teijiro Isokawa, Ferdinand Peper, Ibuki Kawamata, Masami Hagiya
187-199

 

 


Designed by Inria-IES Team : http://hal.inria.fr/    Hosted by HAL : http://hal.archives-ouvertes.fr/