Controlled H Systems of Small Radius

Authors:
Andrei Păun
Affiliations:
Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109 Bucureşti, Romania. E-mail: paun@sandwich.math.math.unibuc.ro
Venue:
Fundamenta Informaticae
Year:
1997

Citing 7
Cited 0

Splicing semigroups of dominoes and DNA

Discrete Mathematics
Regularity of splicing languages

Discrete Applied Mathematics
Splicing systems with targets are computationally universal

Information Processing Letters
Computing by splicing

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
Theory of Computation: A Primer

Theory of Computation: A Primer

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several characterizations of recursively enumerable languages are given, using H systems with permitting contexts having splicing rules of small radius. Representations of context-free languages are also obtained in certain particular cases. These results improve previous related results which were recently published. Some open problems are also pointed out.