Regularity of splicing languages
Discrete Applied Mathematics
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Theoretical Computer Science - Special issue on universal machines and computations
Regular extended H systems are computationally universal
Journal of Automata, Languages and Combinatorics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Nine test tubes generate any RE language
Theoretical Computer Science - Special issue on universal machines and computations
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
DNA computing based on splicing: universality results
Theoretical Computer Science - Special issue on universal machines and computations
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
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
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Splicing systems for universal turing machines
DNA'04 Proceedings of the 10th international conference on DNA computing
Time-Varying Distributed H Systems: An Overview
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Sequential p systems with regular control
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
A time-varying distributed H system (TVDH system) is a splicing system which has the following feature: at different moments one uses different sets of splicing rules (these sets are called components of TVDH system). The number of components is called the degree of the TVDH system. The passing from a component to another one is specified in a cycle. It was proved by both authors (1999) that TVDH systems of degree 2 generate all recursively enumerable languages. It was made by modelling Turing machines and, in that modelling, every language is generated "step by step" or "word by word". This solution is not a fully parallel one. A. Paun (1999) presented a complete parallel solution for TVDH systems of degree 4 by modelling type 0 formal grammars. Now we improved A. Paun's result by reducing the number of components of such TVDH systems down to 3. This question is open for 2 components, i.e. is it possible to construct TVDH systems of degree 2 which completely uses the parallel nature of molecular computations based on splicing operations (say model type 0 formal grammars). We consider also original G. Paun's definition of TVDH systems and suggest a slightly different definition of TVDH systems based on the definition of H systems - extended time-varying distributed H systems (ETVDH systems). For this new definition we proved that ETVDH systems with one component generate exactly the set of all regular languages and that with two components, they generate exactly the set of all recursively enumerable languages.