메뉴 건너뛰기




Volumn 356, Issue 1-2, 2006, Pages 170-185

Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D ⌊ logm D ⌋

Author keywords

Cellular automata; Synchronization

Indexed keywords

AUTOMATION; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION TECHNOLOGY; INTERNET; PROBLEM SOLVING; SYNCHRONIZATION;

EID: 33744719791     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.032     Document Type: Article
Times cited : (6)

References (13)
  • 1
    • 33744719049 scopus 로고    scopus 로고
    • C. Choffrut (Ed.), Automata Networks, Lecture Notes in Computer Science, Vol. 50, Springer, Berlin, 1986.
  • 2
    • 0024769506 scopus 로고    scopus 로고
    • T. Jiang, The synchronization of non uniform networks of finite automata, in: FOCS, Vol. 89, 1989, pp. 376-381.
  • 3
    • 38249015144 scopus 로고
    • The synchronization of non uniform networks of finite automata
    • Jiang T. The synchronization of non uniform networks of finite automata. Inform. and Comput. 97 2 (1992) 234-261
    • (1992) Inform. and Comput. , vol.97 , Issue.2 , pp. 234-261
    • Jiang, T.1
  • 5
    • 85034807424 scopus 로고
    • An overview of the firing squad synchronization problem
    • Choffrut C. (Ed), Springer, Berlin
    • Mazoyer J. An overview of the firing squad synchronization problem. In: Choffrut C. (Ed). Automata Networks, Lecture Notes in Computer Science Vol. 50 (1986), Springer, Berlin 82-94
    • (1986) Automata Networks, Lecture Notes in Computer Science , vol.50 , pp. 82-94
    • Mazoyer, J.1
  • 6
    • 33744720001 scopus 로고    scopus 로고
    • J. Mazoyer, Synchronization of a line of finite automata with non uniform delays, 1990, unpublished.
  • 8
    • 3042620105 scopus 로고
    • Existence d'automates capables de s'accorder bien qu'arbitrairement connectés et nombreux
    • Rosenstiehl P. Existence d'automates capables de s'accorder bien qu'arbitrairement connectés et nombreux. Internat. Comput. Center Bull. 5 (1966) 245-261
    • (1966) Internat. Comput. Center Bull. , vol.5 , pp. 245-261
    • Rosenstiehl, P.1
  • 9
    • 0004499550 scopus 로고
    • Intelligent graphs: networks of finite automata capable of solving graph problems
    • Read R.C. (Ed), Academic Press, New York
    • Rosenstiehl P., Fiksel J.R., and Holliger A. Intelligent graphs: networks of finite automata capable of solving graph problems. In: Read R.C. (Ed). Graph Theory and Computing (1972), Academic Press, New York 219-265
    • (1972) Graph Theory and Computing , pp. 219-265
    • Rosenstiehl, P.1    Fiksel, J.R.2    Holliger, A.3
  • 10
    • 0005724801 scopus 로고
    • A fault-tolerant scheme for optimum-time firing squad synchronization
    • Joubert G.R., Peters F.J., Trystram D., and Evans D.J. (Eds), Elsevier, Amsterdam
    • Umeo H. A fault-tolerant scheme for optimum-time firing squad synchronization. In: Joubert G.R., Peters F.J., Trystram D., and Evans D.J. (Eds). Parallel Computing: Trends and Applications (1994), Elsevier, Amsterdam 223-230
    • (1994) Parallel Computing: Trends and Applications , pp. 223-230
    • Umeo, H.1
  • 11
    • 0030523235 scopus 로고    scopus 로고
    • A quasi-optimal time for synchronizing two interacting finite automata
    • Vivien H. A quasi-optimal time for synchronizing two interacting finite automata. J. Algebra Comput. 6 2 (1996) 261-267
    • (1996) J. Algebra Comput. , vol.6 , Issue.2 , pp. 261-267
    • Vivien, H.1
  • 12
    • 33744773752 scopus 로고    scopus 로고
    • H. Vivien, Cellular Automata: A Geometrical Approach, to appear.
  • 13
    • 33744744928 scopus 로고    scopus 로고
    • J.-B. Yunés, Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata, to appear.


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