The following pages link to Computing by splicing (Q1349864):
Displayed 21 items.
- Commutator algebras arising from splicing operations (Q403191) (← links)
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Accepting splicing systems (Q974105) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Sticker systems (Q1275468) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Separating some splicing models. (Q1603389) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- Simulating R Systems by P Systems (Q2975902) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- Defining Languages by Forbidding-Enforcing Systems (Q3091444) (← links)
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537) (← links)
- (Q5061519) (← links)
- Non-preserving splicing with delay (Q5297935) (← links)
- Matrix splicing system (Q5852139) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)