Efficient exhaustive listings of reversible one dimensional cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
The Complexity of Small Universal Turing Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of Composing Non-linear Machines with Predictable Cyclic Structures
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.01 |