Abstract
A time-varying distributed H system is a splicing system which has the following feature: at different moments one uses different sets of splicing rules. The number of these sets is called the degree of the system. The passing from one set of rules to another is specified in a cycle. It is known that any formal language can be generated by a time-varying distributed H-system of degree at least 4. We already proved that there are universal time-varying distributed H-systems of degree 2. In this paper we strengthen that result by showing, for any recursively enumerable language, how to construct a time-varying distributed H-system of degree 2 that generates that language exactly. We also indicate that such a construction is impossible for time-varying distributed H-systems of degree 1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kleene, S.C. (1952), Introduction to Metamathematics, Van Nostrand, New York.
Margenstern, M. (1997), The laterality problem is completely solved, Theoretical Informatics and Applications, RAIRO/ITA, 31.2: 159–204.
Margenstern, M. & Yu. Rogozhin (1998), A universal time-varying distributed H-system of degree 2, in Preliminary Proceedings of the Fourth International Meeting on DNA Based Computers: 83-88, University of Pennsylvania, Philadelphia.
Margenstern, M. & Yu. Rogozhin (1999), A universal time-vary ing distributed H-system of degree 2, Biosystems, 52: 73–80.
Margenstern, M. & Yu. Rogozhin (1999), Generating all recursively enumerable languages with a time-varying distributed H-system of degree 2, Technical Report, Institut Universitaire de Technologie de Metz, ISBN 2-9511539-5-3.
Păun, A. (1999), On Time-Varying H Systems, Bulletin of the European Association for Theoretical Computer Science, 67: 157–164.
Păun, Gh. (1997), DNA computing: distributed splicing systems, in Structures in Logic and Computer Science. A Selection of Essays in honor of A. Ehrenfeucht: 353-370, Springer, Berlin.
Păun, Gh. (1998), DNA Computing Based on Splicing: Universality Results, in Proceedings of MCU’98, I, ISBN 2-9511539-2-9: 67-91.
Păun, Gh.; G. Rozenberg & A. Salomaa (1998), DNA Computing: New Computing Paradigms, Springer, Berlin.
Rogozhin, Yu. (1996), Small universal Turing machines, Theoretical Computer Science, 168.2:215–240.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Margenstern, M., Rogozhin, Y. (2001). Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages. In: MartÃn-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_35
Download citation
DOI: https://doi.org/10.1007/978-94-015-9634-3_35
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5607-8
Online ISBN: 978-94-015-9634-3
eBook Packages: Springer Book Archive