Inducing an order on cellular automata by a grouping operation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 116-127

  Mazoyer, Jacques ^a   Rapaport, Ivan ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL MINIMA; INFINITE CHAINS; NILPOTENCY; NON-TRIVIAL; PREORDERS; UNDECIDABILITY;

CELLULAR AUTOMATA; COMPUTER SCIENCE; EQUIVALENCE CLASSES; FLAME RESISTANCE; PATTERN RECOGNITION SYSTEMS; TRANSLATION (LANGUAGES); TUNGSTEN;

AUTOMATA THEORY;

EID: 78649837304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028554     Document Type: Conference Paper

References (8)

1. Albert J., Culik II K.: A simple universal cellular automaton and its one-way and totalisting version. Complex Systems 1 (1987) 1-16.
2. Culik II K., Pacht J., Yu S.: On the limit sets of cellular automata. SIAM J. Computing 18 (1989) 831-842.
3. Karl J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Computing 21 (1992) 571-586.
4. Martin B.: A universal cellular automaton in quasi-linear time and its s-m-n form. Theoretical Computer Science 123(2) (1994) 199-237.
5. Moore E.F.: Sequential machines, selected papers. Addison Wesley Reading Mass. (1964) 213-214.
6. Mazoyer J., Reimen N.: A linear speed-up theorem for cellular automata. Theoretical Computer Science 101 (1992) 59-98.
7. Smith III A.R.: Simple computation-universal cellular spaces. Journal ACM 18 (1971) 339-353.
8. Wolfram S.: Universality and complexity in cellular automata. Physica D 10 (1984) 1-35.