The following pages link to (Q4886801):
Displayed 21 items.
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- On length-separating test tube systems (Q934977) (← links)
- Accepting splicing systems (Q974105) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- Nine test tubes generate any RE language (Q1575921) (← links)
- Cut, paste and filter. (Q1811127) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Networks of splicing processors with evaluation sets as optimization problems solvers (Q2282068) (← links)
- Polarization: a new communication protocol in networks of bio-inspired processors (Q2299886) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- A General Framework for Regulated Rewriting Based on the Applicability of Rules (Q3009336) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- Networks of Polarized Splicing Processors (Q5055983) (← links)
- (Q5061519) (← links)
- A Formal Framework for Static (Tissue) P Systems (Q5452062) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Logical string rewriting (Q5941560) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)