Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small deterministic Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
The Solvability of the Halting Problem for 2-State Post Machines
Journal of the ACM (JACM)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Theory of Automata
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Theories of abstract automata (Prentice-Hall series in automatic computation)
Theories of abstract automata (Prentice-Hall series in automatic computation)
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
About Universal Hybrid Networks of Evolutionary Processors of Small Size
Language and Automata Theory and Applications
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
| Hi-index | 0.00 |
We consider a new kind of machines with a circular tape and moving in one direction only, so-called Circular Post machines. Using 2- tag systems we construct some new small universal machines of this kind.