We consider two classes of restricted H systems, both dealing with numbers associated to the terms of splicing operations. In one of them, these numbers indicate the age of the strings (the generation when the strings are produced), in the second one the numbers can be interpreted as valences of the strings. Restricting the splicing to strings of "a similar age", or accepting as complete splicing processes only those processes which produce strings with a null valence increase the generative power of H systems (with finite sets of rules)
We continue the investigations begun in [11] on the relationships between several variants of the sp...
AbstractFirst, we recall some characterizations of recursively enumerable languages by means of fini...
Abstract. The paper extends some of the most recently obtained results on the computational universa...
Some representations and extensions of the combinatorial mechanism of splicing are introduced that h...
Abstract: H systems are DNA computing models, based on the operation of splicing. P systems are memb...
AbstractIn this paper, we propose a new definition of the language generated by a splicing system, m...
A Head splicing system (H-system)consists of a finite set of strings (words) written over a finite a...
A Head splicing system (H-system)consists of a finite set of strings (words) written over a finite a...
The concept of splicing system was first introduced by Head in 1987 as a theoretical proposal for DN...
The mathematical modelling of splicing systems (H systems) was initiated by Head in 1987. By restric...
In 1987 Head introduced a new operation on strings, called splicing, as a formal model of certain cu...
Splicing system is a formal characterization of the generative capacity of specified enzymatic activ...
Splicing system is a formal characterization of the generative capacity of specified enzymatic activ...
We introduce a new variant of the heavily studied model of H systems. The new variant will use an ex...
We cast a new look on time-varying distributed H systems. In their original definition, where only n...
We continue the investigations begun in [11] on the relationships between several variants of the sp...
AbstractFirst, we recall some characterizations of recursively enumerable languages by means of fini...
Abstract. The paper extends some of the most recently obtained results on the computational universa...
Some representations and extensions of the combinatorial mechanism of splicing are introduced that h...
Abstract: H systems are DNA computing models, based on the operation of splicing. P systems are memb...
AbstractIn this paper, we propose a new definition of the language generated by a splicing system, m...
A Head splicing system (H-system)consists of a finite set of strings (words) written over a finite a...
A Head splicing system (H-system)consists of a finite set of strings (words) written over a finite a...
The concept of splicing system was first introduced by Head in 1987 as a theoretical proposal for DN...
The mathematical modelling of splicing systems (H systems) was initiated by Head in 1987. By restric...
In 1987 Head introduced a new operation on strings, called splicing, as a formal model of certain cu...
Splicing system is a formal characterization of the generative capacity of specified enzymatic activ...
Splicing system is a formal characterization of the generative capacity of specified enzymatic activ...
We introduce a new variant of the heavily studied model of H systems. The new variant will use an ex...
We cast a new look on time-varying distributed H systems. In their original definition, where only n...
We continue the investigations begun in [11] on the relationships between several variants of the sp...
AbstractFirst, we recall some characterizations of recursively enumerable languages by means of fini...
Abstract. The paper extends some of the most recently obtained results on the computational universa...