Automates cellulaires : dynamique directionnelle et asymptotique typique
暂无分享,去创建一个
[1] Abraham Waksman,et al. An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..
[2] Alvy Ray Smith,et al. Simple Computation-Universal Cellular Spaces , 1971, JACM.
[3] P. Kurka. Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.
[4] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[5] Martin Delacourt. Rice's Theorem for μ-Limit Sets of Cellular Automata , 2011, ICALP.
[6] Marcus Pivato. Spectral Domain Boundaries in Cellular Automata , 2007, Fundam. Informaticae.
[7] Nicolas Ollinger,et al. Collisions and their Catenations: Ultimately Periodic Tilings of the Plane , 2008, IFIP TCS.
[8] Martin Delacourt,et al. Construction of µ-limit Sets , 2010, JAC.
[9] Bastien Chopard,et al. Cellular Automata Modeling of Physical Systems: Index , 1998 .
[10] Marcus Pivato. Defect particle kinematics in one-dimensional cellular automata , 2007, Theor. Comput. Sci..
[11] Véronique Terrier,et al. Signals in One-Dimensional Cellular Automata , 1999, Theor. Comput. Sci..
[12] Mathieu Sablik. Directional dynamics for cellular automata: A sensitivity to initial condition approach , 2008, Theor. Comput. Sci..
[13] G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.
[14] Marcus Pivato. Algebraic invariants for crystallographic defects in cellular automata , 2006, Ergodic Theory and Dynamical Systems.
[15] Jarkko Kari. Rice's Theorem for the Limit Sets of Cellular Automata , 1994, Theor. Comput. Sci..
[16] Jarkko Kari. The Nilpotency Problem of One-Dimensional Cellular Automata , 1992, SIAM J. Comput..
[17] Jacques Mazoyer,et al. A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem , 1987, Theor. Comput. Sci..
[18] Mike Hurley. Ergodic aspects of cellular automata , 1990 .
[19] Mike Hurley. Attractors in cellular automata , 1990 .
[20] Alejandro Maass,et al. Limit Sets of Cellular Automata Associated to Probability Measures , 2000 .
[21] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .
[22] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[23] Karel Culik,et al. On the Limit Sets of Cellular Automata , 1989, SIAM J. Comput..
[24] Guillaume Theyssier,et al. Directional dynamics along arbitrary curves in cellular automata , 2011, Theor. Comput. Sci..
[25] John Myhill. Shorter Note: The Converse of Moore's Garden-of-Eden Theorem , 1963 .
[26] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[27] Nicolas Ollinger,et al. The Quest for Small Universal Cellular Automata , 2002, ICALP.
[28] Pierre Guillon,et al. Revisiting the Rice Theorem of Cellular Automata , 2010, STACS.
[29] Patrick C. Fischer,et al. Generation of Primes by a One-Dimensional Real-Time Iterative Array , 1965, JACM.
[30] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[31] Nicolas Ollinger,et al. Automata on the plane vs particles and collisions , 2009, Theor. Comput. Sci..
[32] Harold Fredricksen,et al. Lexicographic Compositions and deBruijn Sequences , 1977, J. Comb. Theory, Ser. A.
[33] Guillaume Theyssier,et al. On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures , 2006, MFCS.
[34] Karel Culik,et al. Undecidability of CA Classification Schemes , 1988, Complex Syst..
[35] C. Mauduit,et al. Substitutions in dynamics, arithmetics, and combinatorics , 2002 .