SCOPUS 정보 검색 플랫폼

Volumn 46, Issue 7, 2001, Pages 600-603

A complexity analysis of the elementary cellular automaton of rule 122

Author keywords

Cellular automaton; Complexity; Context free language; Formal language; Limit language; Regular language

Indexed keywords

ARTICLE; CHAOTIC DYNAMICS; COMPUTER; LANGUAGE; MATHEMATICAL ANALYSIS; SYMBOLISM; THEORY;

EID: 0034988220 PISSN: 10016538 EISSN: None Source Type: Journal
DOI: 10.1007/BF02900420 Document Type: Article

Times cited : (11)

References (12)

1
- 0021755192
- Cellular automata as models of complexity
- (1984) Nature , vol.311 , Issue.4 , pp. 419
- Wolfram, S.¹

2
- 0004122371
- Cambridge: Cambridge Univ. Press
- (1990) Perspective of Nonlinear Dynamics , vol.2
- Jackson, E.A.¹

3
- 0004864573
- Dordrecht/Boston/London: Kluwer Academic Publishers
- (1999) Cellular Automata: A Parallel Model
- Delorme, M.¹ Mazoyer, J.²

5
- 0004281121
- Shanghai: Shanghai Scientific and Technological Education Publishing House
- (1994) Complexity and Dynamical Systems (in Chinese)
- Xie, H.M.¹

7
- 0002812729
- Computation theory of cellular automota
- (1984) Comm. Math. Phys. , vol.96 , pp. 15
- Worlfram, S.¹

8
- 0001657151
- Recursive cellular automata invariant sets
- (1990) Complex System , Issue.4 , pp. 119
- Hurd, L.P.¹

9
- 0004873479
- Nonrecursive cellular automata invariant sets
- (1990) Complex System , Issue.4 , pp. 131
- Hurd, L.P.¹

12
- 0003077570
- A helpful result for proving inherent ambiguity
- (1968) Math. Systems Theory , vol.2 , pp. 191
- Ogden, W.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.