2015 Third International Symposium on Computing and Networking (CANDAR) 2015
DOI: 10.1109/candar.2015.111
|View full text |Cite
|
Sign up to set email alerts
|

An Analyzable Method for Constructing a Cellular Automaton from a Continuous System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
7
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(8 citation statements)
references
References 6 publications
1
7
0
Order By: Relevance
“…Recently, according to the point related to the necessity of theoretical understanding of the choice of the local rules, Kawaharada, Miyaji, and Nakano proposed a different method of collecting data in numerical experiments [4]. The method is compatible with the theoretical study on the selectivity of the CA unlike with the experimental method.…”
Section: Introductionmentioning
confidence: 54%
See 4 more Smart Citations
“…Recently, according to the point related to the necessity of theoretical understanding of the choice of the local rules, Kawaharada, Miyaji, and Nakano proposed a different method of collecting data in numerical experiments [4]. The method is compatible with the theoretical study on the selectivity of the CA unlike with the experimental method.…”
Section: Introductionmentioning
confidence: 54%
“…L = 10 3 is sufficiently large for constructing local rules of a deterministic CA as shown in [4]. Although a probability matrix of a stochastic CA changes depending on L, we obtained similar results for larger values of L. Section IV.B of [4] discussed the numerical study on how the resultant local rule of a CA depends on L. We used the Mersenne Twister to generate pseudorandom numbers [8].…”
Section: Numerical Examplesmentioning
confidence: 72%
See 3 more Smart Citations