Result 1 to 20 of 142 total
Convergence and feedback: a framework for bounded cellular automata design. (English)
J. Cell. Autom. 6, No. 4-5, 399-416 (2011).
1
A simple model of asynchronous cellular automata exploiting fluctuation. (English)
J. Cell. Autom. 6, No. 4-5, 341-352 (2011).
2
A simple universal Turing machine for the game of life Turing machine. (English)
J. Cell. Autom. 6, No. 4-5, 323-340 (2011).
3
Global control in polymorphic cellular automata. (English)
J. Cell. Autom. 6, No. 4-5, 301-321 (2011).
4
The evolution of finite 1-dimensional cellular automata updated with $k$-rules. (English)
J. Cell. Autom. 6, No. 6, 505-515 (2011).
5
Complex dynamics behaviors in cellular automata rule 35. (English)
J. Cell. Autom. 6, No. 6, 487-504 (2011).
6
Cellular automata on a $G$-set. (English)
J. Cell. Autom. 6, No. 6, 461-486 (2011).
7
Cryptographically suitable maximum length cellular automata. (English)
J. Cell. Autom. 6, No. 6, 439-459 (2011).
8
The cups and stones counting problem, the Sierpinski gasket, cellular automata, fractals and Pascal’s triangle. (English)
J. Cell. Autom. 6, No. 6, 421-437 (2011).
9
Evolution of self-assembling patterns in cellular automata using development. (English)
J. Cell. Autom. 6, No. 4-5, 257-300 (2011).
10
Representation of additive cylindrical cellular automata with roots of unity. (English)
J. Cell. Autom. 6, No. 1, 105-119 (2011).
11
Designing cryptographically strong S-boxes with use of 1D cellular automata. (English)
J. Cell. Autom. 6, No. 1, 91-104 (2011).
12
Derivation and representation of one-dimensional, reversible, number-conserving cellular automata rules. (English)
J. Cell. Autom. 6, No. 1, 77-89 (2011).
13
Larger than life’s invariant measures. (English)
J. Cell. Autom. 6, No. 1, 53-75 (2011).
14
On the asymptotic behaviour of circular fuzzy cellular automata. (English)
J. Cell. Autom. 6, No. 1, 25-52 (2011).
15
Target-oriented self-structuring in classifying cellular automata. (English)
J. Cell. Autom. 6, No. 1, 3-23 (2011).
16
Glider dynamics on the sphere: exploring cellular automata on geodesic grids. (English)
J. Cell. Autom. 6, No. 2-3, 245-256 (2011).
17
An example of one-sided, D-chaotic CA over four elementary alphabet, which is not E-chaotic and not injective. (English)
J. Cell. Autom. 6, No. 2-3, 231-243 (2011).
18
Cellular automata over group alphabets: undergraduate education and the PascGalois project. (English)
J. Cell. Autom. 6, No. 2-3, 215-230 (2011).
19
On a characterization of locally finite groups in terms of linear cellular automata. (English)
J. Cell. Autom. 6, No. 2-3, 207-213 (2011).
20
Result 1 to 20 of 142 total
Start
Contact
Print
General Help
