메뉴 건너뛰기




Volumn 52, Issue 1-3, 2002, Pages 249-256

Cellular automata and intermediate reachability problems

Author keywords

Cellular automata; Confluence problem; Intermediate degrees

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SIMULATION; DECISION MAKING; HEURISTIC METHODS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

EID: 0036763235     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (13)

References (17)
  • 1
    • 0000311275 scopus 로고    scopus 로고
    • On the classifiability of cellular automata
    • Baldwin, J.T., Shelah, S.: On the Classifiability of Cellular Automata, Theoretical Computer Science, 230(1-2), 2000, 117-129.
    • (2000) Theoretical Computer Science , vol.230 , Issue.1-2 , pp. 117-129
    • Baldwin, J.T.1    Shelah, S.2
  • 3
    • 0012033219 scopus 로고
    • Cellular automata, ωω-regular sets, and sofic systems
    • Culik, K., Yu, S.: Cellular Automata, ωω-regular Sets, and Sofic Systems, Discrete Applied Mathematics, 32, 1991, 85-101.
    • (1991) Discrete Applied Mathematics , vol.32 , pp. 85-101
    • Culik, K.1    Yu, S.2
  • 4
    • 0012067384 scopus 로고
    • Perspectives in mathematical logic
    • Springer Verlag
    • Lerman, M.: Degrees of Unsolvability, Perspectives in Mathematical Logic, Springer Verlag, 1983.
    • (1983) Degrees of Unsolvability
    • Lerman, M.1
  • 8
    • 0001514019 scopus 로고
    • A note on Culik-Yu classes
    • Sutner, K.: A note on Culik-Yu classes, Complex Systems, 3(1), 1989, 107-115.
    • (1989) Complex Systems , vol.3 , Issue.1 , pp. 107-115
    • Sutner, K.1
  • 9
    • 0002595091 scopus 로고
    • Classifying circular cellular automata
    • Sutner, K.: Classifying Circular Cellular Automata, Physica D, 45(1-3), 1990, 386-395.
    • (1990) Physica D , vol.45 , Issue.1-3 , pp. 386-395
    • Sutner, K.1
  • 10
    • 0002757715 scopus 로고
    • De Bruijn graphs and linear cellular automata
    • Sutner, K.: De Bruijn Graphs and Linear Cellular Automata, Complex Systems, 5(1), 1991, 19-30.
    • (1991) Complex Systems , vol.5 , Issue.1 , pp. 19-30
    • Sutner, K.1
  • 11
    • 0029252127 scopus 로고
    • The complexity of finite cellular automata
    • Sutner, K.: The Complexity of Finite Cellular Automata, Journal of Computer and Systems Sciences, 50(1), 1995, 87-97.
    • (1995) Journal of Computer and Systems Sciences , vol.50 , Issue.1 , pp. 87-97
    • Sutner, K.1
  • 13
    • 0002812729 scopus 로고
    • Computation theory of cellular automata
    • Wolfram, S.: Computation Theory of Cellular Automata, Comm. Math. Physics, 96(1), 1984, 15-57.
    • (1984) Comm. Math. Physics , vol.96 , Issue.1 , pp. 15-57
    • Wolfram, S.1
  • 14
    • 0020495993 scopus 로고
    • Universality and complexity in cellular automata
    • Wolfram, S.: Universality and Complexity in Cellular Automata, Physica D, 10, 1984, 1-35.
    • (1984) Physica D , vol.10 , pp. 1-35
    • Wolfram, S.1
  • 15
    • 0012095448 scopus 로고    scopus 로고
    • Private communication
    • Wolfram, S.: Private communication, 1999.
    • (1999)
    • Wolfram, S.1
  • 17
    • 0012091836 scopus 로고
    • The constructibility of a configuration in a cellular automaton
    • Yaku, T.: The Constructibility of a Configuration in a Cellular Automaton, Journal of Computer and Systems Sciences, 7, 1973, 481-496.
    • (1973) Journal of Computer and Systems Sciences , vol.7 , pp. 481-496
    • Yaku, T.1


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