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.
Ferretti, C., Mauri, G., Zandron, C. (2000). Nine test tubes generate any RE language. THEORETICAL COMPUTER SCIENCE, 231(2), 171-180 [10.1016/S0304-3975(99)00098-5].
Nine test tubes generate any RE language
FERRETTI, CLAUDIO;MAURI, GIANCARLO;ZANDRON, CLAUDIO
2000
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
