The following pages link to (Q3125167):
Displayed 27 items.
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Accepting splicing systems (Q974105) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Sticker systems (Q1275468) (← links)
- Simple splicing systems (Q1392573) (← links)
- Direct constructions of universal extended H systems. (Q1401272) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Template-guided DNA recombination (Q1763713) (← links)
- Cut, paste and filter. (Q1811127) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- Polarization: a new communication protocol in networks of bio-inspired processors (Q2299886) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- Graph splicing systems (Q2495908) (← links)
- A boundary result on enhanced time-varying distributed H systems with parallel computations (Q2575080) (← links)
- Some wonders of a bio-computer-scientist (Q2678667) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- On Computational Properties of Template-Guided DNA Recombination (Q3618678) (← links)
- Networks of Polarized Splicing Processors (Q5055983) (← links)
- (Q5061519) (← links)
- DNA Splicing Systems (Q5452697) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Formal properties of PA-matching (Q5958115) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)