Cellular Automata: Proceedings of an Interdisciplinary Workshop, Los Alamos, New Mexico 87545, USA, March 7-11, 1983Doyne Farmer, Tommaso Toffoli, Stephen Wolfram |
From inside the book
Results 1-3 of 6
Page 23
... regular grammar . A regular grammar [ 15-18 ] ( or " sofic system " [ 19 ] ) specifies a regular language , whose legal works may be recognized by a finite automaton , represented by a finite state transition graph . A sequence of ...
... regular grammar . A regular grammar [ 15-18 ] ( or " sofic system " [ 19 ] ) specifies a regular language , whose legal works may be recognized by a finite automaton , represented by a finite state transition graph . A sequence of ...
Page 28
... regular grammar . In general the complexity of the gram- mar may increase rapidly with the number of time steps , potentially leading at infinite time to a set not specifiable by a regular grammar . Such behav- iour may generically be ...
... regular grammar . In general the complexity of the gram- mar may increase rapidly with the number of time steps , potentially leading at infinite time to a set not specifiable by a regular grammar . Such behav- iour may generically be ...
Page 30
... regular grammar . The nonvanishing value of the average minimum propagation speed for class 3 cellular automata , suggests that in all cases the value of a particular site depends on an ever - increasing number of initial site values ...
... regular grammar . The nonvanishing value of the average minimum propagation speed for class 3 cellular automata , suggests that in all cases the value of a particular site depends on an ever - increasing number of initial site values ...
Contents
WOLFRAM S Universality and complexity in cellular automata | 1 |
A Applications of ergodic theory and sofic systems to cellular automata | 36 |
S Some applications of information theory to cellular automata | 45 |
Copyright | |
18 other sections not shown
Common terms and phrases
algorithm array attractors automaton BBMCA behavior binary blocks Boolean functions Cantor set cell cellular automata cellular automaton evolution cellular automaton rules chromophore class 3 cellular complex computation connection machine construction corresponding defined density differential equations dimension discrete discussed DNA sequences dynamical systems electron elements entropy ergodic ergodic theory example finite fractal Hausdorff dimension Independent clocks infinite initial configuration inputs integer interactions Ising model iteration lattice length limit cycle logical loop macro-cell mapping mathematical mean period 100 mechanism models molecular neighbors nodes nonlinear nonzero operations oscillations parameter patterns Phys possible processing propagation properties protein puffer train random regular grammar reversible self-reproduction signal simple simulation soliton space spatial spins step switching Synchronous temporal theorem theory tion Toffoli Tommaso Toffoli totalistic rule transition rules typically universal variables video feedback Wolfram zero