About Time-Varying Distributed H Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A Universal Time-Varying Distributed H System of Degree 1
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The power of reachability testing for timed automata
Theoretical Computer Science
Small turing machines and generalized busy beaver competition
Theoretical Computer Science
Analysis of busy beaver machines via induction proofs
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Tag systems and Collatz-like functions
Theoretical Computer Science
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
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Study of limits of solvability in tag systems
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Fundamenta Informaticae
Inclusion problems for patterns with a bounded number of variables
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
A new weakly universal cellular automaton in the 3D hyperbolic space with two states
RP'11 Proceedings of the 5th international conference on Reachability problems
On the computation power of finite automata in two-dimensional environments
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
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
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Inclusion problems for patterns with a bounded number of variables
Information and Computation
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Ten years of weakly universal cellular automata in the hyperbolic plane
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |