On the power of the splicing operation1

DOI10.1080/00207169508804451MaRDI QIDQ4870965zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

undecidabilitysplicing systemsenumerable language

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• Splicing semigroups of dominoes and DNA

Cited in

(11)

• Derivation languages and descriptional complexity measures of restricted flat splicing systems
• scientific article; zbMATH DE number 1418477 (Why is no real title available?)
• Splicing systems and the Chomsky hierarchy
• scientific article; zbMATH DE number 1836441 (Why is no real title available?)
• A brief tour of theoretical tile self-assembly
• Splicing in abstract families of languages
• On derivation languages of a class of splicing systems
• Computing by splicing
• DNA computing: Arrival of biological mathematics
• Using DNA to solve the bounded Post correspondence problem
• Membrane Computing

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)