Nine test tubes generate any RE language

DOI10.1016/S0304-3975(99)00098-5zbMath0951.68064OpenAlexW2134468766WikidataQ57518644 ScholiaQ57518644MaRDI QIDQ1575921

Claudio Ferretti, Giancarlo Mauri, Claudio Zandron

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00098-5

zbMATH Keywords

recursively enumerable languagedistributed splicing system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Frontier between decidability and undecidability: A survey ⋮ Topics in the theory of DNA computing.

Cites Work

• Unnamed Item
• Unnamed Item