Splicing semigroups of dominoes and DNA
Discrete Mathematics
Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
Regularity of splicing languages
Discrete Applied Mathematics
Splicing systems with targets are computationally universal
Information Processing Letters
Discrete Applied Mathematics
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
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Theory of Computation: A Primer
Theory of Computation: A Primer
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
| Hi-index | 0.00 |
This paper is an up-to-dated survey of results about the power of controlled extended H systems of various types. Such systems are finite generative devices based on the splicing operation, which, in turn, is a model of the DNA recombination. When no control is imposed on the splicing operation, we get a characterization of regular languages. When a control is considered, we obtain characterizations of recursively enumerable languages. We briefly discuss here H systems with control mechanisms similar to those in regulated rewriting area in formal language theory. We do not present proofs, but only definitions, results, and bibliographical information. Looking for characterizations of families in Chomsky hierarchy other than those of regular and of recursively enumerable languages, we closely investigate the H systems with permitting context conditions. We disprove a conjecture of Chakaravarthy and Krithivasan: such systems of radius one and using only one-sided context conditions can generate all context-free languages (the conjecture was that a characterization of linear languages is obtained). Some open problems are also mentioned.