Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages

Maurice Margenstern () and Yurii Rogozhin ()
Additional contact information
Maurice Margenstern: University Institute of Technology, Metz Group of Foundational Computer Science
Yurii Rogozhin: Academy of Sciences of Moldova, Institute of Mathematics and Informatics

Chapter Chapter 35 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 399-407 from Springer

Abstract: 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.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_35

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_35

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().