Abstract
In this paper we prove that each recursively enumerable language can be generated using a distributed splicing system with a fixed number of test tubes. This improves a recent result by Csuhaj-Varjú, Kari, Păun, proving computational completeness only for a system with a number of tubes depending on the cardinality of the used alphabet.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. M. Adleman, Molecular computation of solutions of combinatorial problems, Science, 226 (1994), 1021–1024.
E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.
E. Csuhaj-Varjú, L. Kari, Gh. Păun, Test tube distributed system based on splicing, Computer and AI, 15, 2–3 (1996), 211–232.
T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours, Bull. Math. Biology, 49 (1987), 737–759.
Gh. Păun, Regular extended H systems are computationally universal, J. Automata, Languages, Combinatorics, 1, 2 (1996), 27–36.
* * *, Proceedings of Second DIMACS workshop on DNA computing, Princeton, 1996, to be published by ACM Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zandron, C., Ferretti, C., Mauri, G. (1997). A reduced distributed splicing system for RE languages. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive