Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.
Bruno Durand
Venue
B
FCT
Year
1993
Proceedings
FCT
DBLP record
conf/fct/Durand93 ↗
Browse the full
FCT paper archive
.