Splicing semigroups of dominoes and DNA
Discrete Mathematics
Regularity of splicing languages
Discrete Applied Mathematics
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
On the universality of Post and splicing systems
Theoretical Computer Science - Special issue on universal machines and computations
About Time-Varying Distributed H Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
An alternative definition of splicing
Theoretical Computer Science
Non-preserving splicing with delay
International Journal of Computer Mathematics
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
Solving SAT and HPP with accepting splicing systems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
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.00 |
In this paper, we look at extended splicing systems (i.e., H systems) in order to find how small such a system can be in order to generate a recursively enumerable language. It turns out that starting from a Turing machine M with alphabet A and finite set of states Q which generates a given recursively enumerable language L, we need around 2 × |I| + 2 rules in order to define an extended H system ${\cal H}$ which generates L, where I is the set of instructions of Turing machine M. Next, coding the states of Q and the non-terminal symbols of ${\cal L}$, we obtain an extended H system ${\cal H}_1$ which generates L using |A| + 2 symbols. At last, by encoding the alphabet, we obtain a splicing system ${\cal U}$ which generates a universal recursively enumerable set using only two letters.