STACS 2005
From MaRDI portal
Publication:5710668
DOI10.1007/b106485zbMath1118.68566MaRDI QIDQ5710668
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Related Items
Communication complexity meets cellular automata: necessary conditions for intrinsic universality, Bulking II: Classifications of cellular automata, One-dimensional cellular automata with random rules: longest temporal period of a periodic solution, Unraveling simplicity in elementary cellular automata, On the behavior characteristics of cellular automata