SIAM Journal on Computing
A linear speed-up theorem for cellular automata
Theoretical Computer Science - Special issue on logic and applications to computer science
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Two-dimensional cellular automata recognizer
Theoretical Computer Science - Special issue on Caen '97
Computation: finite and infinite machines
Computation: finite and infinite machines
Collision-based computing
Real-time recognition of languages on an two-dimensional Archimedean thread
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Cellular automata: real-time equivalence between one-dimensional neighborhoods
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 5.23 |
Peu de rsultats sont connus sur la puissance de calcul des automates cellulaires 2D. Dans l'approche "reconnaissance de langages", la difficult provient de la multiplicit des plongements possibles d'un mot sur le plan discret. Une question trs simple comme la reconnaisance des langages rationnels en temps rel devient vraiment dlicate. Nous montrons ce rsultat sur deux plongements particuliers (spirale d'Archimde et fil de Hilbert). Cette premire investigation met en vidence que ce qui est difficile est moins l'algorithmique que la nature du plan discret.