최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Theoretical computer science, v.412 no.30, 2011년, pp.3866 - 3880
Delorme, M. (LIF, Aix-Marseille Universite, CNRS, 39 rue Joliot-Curie, 13 013 Marseille, France) , Mazoyer, J. , Ollinger, N. , Theyssier, G.
This paper is the first part of a series of two papers dealing with bulking: a quasi-order on cellular automata comparing space-time diagrams up to some rescaling. Bulking is a generalization of grouping taking into account universality phenomena, giving rise to a maximal equivalence class....
Complex Systems Albert 1 1 1 1987 A simple universal cellular automaton and its one-way and totalistic version
Banks 194 1970 Symposium on Switching and Automata Theory (Santa Monica, California, 1970) Universality in cellular automata
Acta Informatica Choffrut 21 4 393 1984 10.1007/BF00264617 On real-time cellular automata and trellis automata
Theoretical Computer Sciences Delorme 412 30 3881 2011 10.1016/j.tcs.2011.02.024 Bulking II: Classifications of cellular automata
Durand 51 1999 Cellular automata (Saissac, 1996) The game of life: universality revisited
Journal of the ACM Fischer 12 3 388 1965 10.1145/321281.321290 Generation of primes by a one-dimensional real-time iterative array
Mathematical Systems Theory Hedlund 3 320 1969 10.1007/BF01691062 Endormorphisms and automorphisms of the shift dynamical system
SIAM Journal on Computing Ibarra 14 2 426 1985 10.1137/0214033 Sequential machine characterizations of trellis and cellular automata and applications
Lind 1995 An Introduction to Symbolic Dynamics and Coding
Theoretical Computer Sciences Martin 123 2 199 1994 10.1016/0304-3975(92)00076-4 A universal cellular automaton in quasi-linear time and its s-m-n form
Mazoyer 834 1998 Mathematical foundations of computer science (Brno, 1998) Additive cellular automata over Zp and the bottom of (ca,≤)
Discrete Applied Mathematics Mazoyer 91 1-3 177 1999 10.1016/S0166-218X(98)00125-5 Inducing an order on cellular automata by a grouping operation
N. Ollinger, Automates cellulaires: structures, Ph.D. thesis, Ecole Normale Superieure de Lyon, 2002.
G. Theyssier, Automates cellulaires: un modele de complexites, Ph.D. thesis, Ecole Normale Superieure de Lyon, 2005.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.