Publication's Abstract

C. Zandron, C. Ferretti, G. Mauri
A reduced distributed splicing system for RE languages.

Abstract

In this paper we prove that any 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-Varju, Kari, Paun, proving computational completeness only for a system with a number of tubes depending on the cardinality of the used alphabet.