메뉴 건너뛰기
Theoretical Computer Science
Volumn 312, Issue 2-3, 2004, Pages 203-222
Two-dimensional cellular automata and their neighborhoods
Author keywords

[No Author keywords available]
Indexed keywords

ARRAYS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; SET THEORY; THEOREM PROVING; TRANSFER FUNCTIONS; TREES (MATHEMATICS);
EID: 0348230634     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.08.011     Document Type: Article
Times cited : (18)
References (9)
  • 1
    • 84937741242 scopus 로고
    • Real-time computation by n -dimensional iterative arrays of finite-state machine
    • Cole S.N. Real-time computation by. n -dimensional iterative arrays of finite-state machine IEEE Trans. Comput. 18:1969;349-365.
    • (1969) IEEE Trans. Comput. , vol.18 , pp. 349-365
    • Cole, S.N.1
  • 2
    • 34548076011 scopus 로고    scopus 로고
    • Open problems on cellular automata
    • École normale supérieure de Lyon, July
    • M. Delorme, E. Formenti, J. Mazoyer, Open problems on cellular automata, Research Report 2000-25, École normale supérieure de Lyon, July 2000.
    • (2000) Research Report , vol.2000 , Issue.25
    • Delorme, M.1    Formenti, E.2    Mazoyer, J.3
  • 3
    • 0015022738 scopus 로고
    • Machine complexity versus interconnection complexity in iterative arrays
    • Hamacher V.C. Machine complexity versus interconnection complexity in iterative arrays. IEEETC: IEEE Trans. Comput. 20:1971.
    • (1971) IEEETC: IEEE Trans. Comput. , vol.20
    • Hamacher, V.C.1
  • 4
    • 0022061748 scopus 로고
    • Sequential machine characterizations of trellis and cellular automata and applications
    • Ibarra O.H., Kim S.M., Moran S. Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput. 14(2):1985;426-447.
    • (1985) SIAM J. Comput. , vol.14 , Issue.2 , pp. 426-447
    • Ibarra, O.H.1    Kim, S.M.2    Moran, S.3
  • 5
    • 0016071526 scopus 로고
    • On some open problems in the theory of cellular automata
    • Kosaraju S.R. On some open problems in the theory of cellular automata. IEEE Trans. Comput. C-23(6):1974;561-565.
    • (1974) IEEE Trans. Comput. , vol.C-23 , Issue.6 , pp. 561-565
    • Kosaraju, S.R.1
  • 6
    • 0026886532 scopus 로고
    • A linear speed-up theorem for cellular automata
    • Mazoyer J., Reimen N. A linear speed-up theorem for cellular automata. Theoret. Comput. Sci. 101(1):1992;59-98.
    • (1992) Theoret. Comput. Sci. , vol.101 , Issue.1 , pp. 59-98
    • Mazoyer, J.1    Reimen, N.2
  • 7
    • 0015094879 scopus 로고
    • Simple computation-universal cellular spaces
    • Smith III A.R. Simple computation-universal cellular spaces. J. Assoc. Comput. Mach. 18(3):1971;339-353.
    • (1971) J. Assoc. Comput. Mach. , vol.18 , Issue.3 , pp. 339-353
    • Smith III, A.R.1
  • 8
    • 0015199007 scopus 로고
    • Two-dimensional formal languages and pattern recognition by cellular automata
    • East Lansing, Michigan, 13-15 October
    • A.R. Smith III, Two-dimensional formal languages and pattern recognition by cellular automata, in: IEEE Conf. Record 1971 Twelfth Ann. Symp. on Switching and Automata Theory, East Lansing, Michigan, 13-15 October 1971, pp. 144-152.
    • (1971) IEEE Conf. Record 1971 Twelfth Ann. Symp. on Switching and Automata Theory , pp. 144-152
    • Smith III, A.R.1
  • 9
    • 0009752764 scopus 로고    scopus 로고
    • Two-dimensional cellular automata recognizer
    • Terrier V. Two-dimensional cellular automata recognizer. Theoret. Comput. Sci. 218(2):1999;325-346.
    • (1999) Theoret. Comput. Sci. , vol.218 , Issue.2 , pp. 325-346
    • Terrier, V.1

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