On the power of the splicing operation1

DOI10.1080/00207169508804451zbMath0841.68068OpenAlexW2158055296MaRDI QIDQ4870965

Gheorghe Păun

Publication date: 8 April 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804451

zbMATH Keywords

undecidabilitysplicing systemsenumerable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Computing by splicing ⋮ A Brief Tour of Theoretical Tile Self-Assembly ⋮ DNA computing: Arrival of biological mathematics ⋮ Splicing in abstract families of languages ⋮ Using DNA to solve the bounded Post correspondence problem

Cites Work

• Splicing semigroups of dominoes and DNA
• Unnamed Item
• Unnamed Item

This page was built for publication: On the power of the splicing operation¹