Networks of splicing processors: simulations between topologies
From MaRDI portal
Publication:6048242
DOI10.1007/S41965-023-00120-1MaRDI QIDQ6048242
Jose Angel Sanchez Martin, Victor Mitrana, Mihaela Păun
Publication date: 14 September 2023
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accepting networks of splicing processors: complexity results
- Accepting splicing systems
- On small, reduced, and fast universal accepting networks of splicing processors
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Aspects of molecular computing. Essays dedicated to Tom Head on the occasion of his 70th birthday
- On the splicing operation
- Accepting splicing systems with permitting and forbidding words
- Splicing Systems: Accepting Versus Generating
- Networks of Polarized Splicing Processors
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- Small networks of polarized splicing processors are universal
This page was built for publication: Networks of splicing processors: simulations between topologies