On the power of the splicing operation1

DOI10.1080/00207169508804451zbMATH Open0841.68068OpenAlexW2158055296MaRDI QIDQ4870965FDOQ4870965

Authors: 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

Recommendations

• Publication:4942039
• On the splicing operation
• Splicing systems with targets are computationally universal
• scientific article; zbMATH DE number 1836441

zbMATH Keywords

undecidabilitysplicing systemsenumerable language

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Splicing semigroups of dominoes and DNA
• Title not available (Why is that?)

Cited In (11)

• Using DNA to solve the bounded Post correspondence problem
• Title not available (Why is that?)
• Splicing systems and the Chomsky hierarchy
• Computing by splicing
• Splicing in abstract families of languages
• Title not available (Why is that?)
• Derivation languages and descriptional complexity measures of restricted flat splicing systems
• A brief tour of theoretical tile self-assembly
• DNA computing: Arrival of biological mathematics
• Membrane Computing
• On derivation languages of a class of splicing systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870965)