Self-Timed Cellular Automata and their computational ability

Future Generation Computer Systems

Volumn 18, Issue 7, 2002, Pages 893-904

  Peper, F ^a   Isokawa, T ^b   Kouda, N ^b   Matsui, N ^b  

^a NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^b UNIVERSITY OF HYOGO   (Japan)

Author keywords

Asynchronous Cellular Automata; Chain reactions; Self timing; Universal computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS; LOGIC GATES; MATHEMATICAL MODELS;

SELF-TIMED CELLULAR AUTOMATON (STCA);

TURING MACHINES;

EID: 0036639190     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(02)00069-9     Document Type: Conference Paper

References (20)

1. Cellular Automata for nanometer-scale computation
2. On the delay-sensitivity of gate networks
3. (A-)synchronous (non-)deterministic cell spaces simulating each other
4. Asynchronous design methodologies: An overview
5. Structure in asynchronous cellular automata
6. Towards a theory of universal speed-independent modules
7. The limitations to delay-insensitivity in asynchronous circuits
8. Asynchronous Cellular Automata and their computational ability
9. Spatial computing on Self-Timed Cellular Automata
10. System timing
11. Micropipelines
12. DDMP's: Self-timed super-pipelined data-driven multimedia processors
13. Design and self-assembly of two-dimensional DNA crystals