C. Ferretti, G. Mauri, C. Zandron
Nine test tubes generate any RE language.
Abstract
In this paper we discuss how any recursively enumerable language can be
generated using a distributed splicing system with a fixed number of nine
test tubes. This number has been recently reduced by other authors, and in this
work we try to give an insightful algorithmic description of this kind of systems.