The following pages link to On the splicing operation (Q1923595):
Displaying 31 items.
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Computing by splicing (Q1349864) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- Simple splicing systems (Q1392573) (← links)
- Direct constructions of universal extended H systems. (Q1401272) (← links)
- Living systems are dynamically stable by computing themselves at the quantum level (Q1407262) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Regularity of splicing languages (Q1923604) (← links)
- Polarization: a new communication protocol in networks of bio-inspired processors (Q2299886) (← links)
- Theory of tailor automata (Q2315015) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- On the power of circular splicing (Q2565850) (← links)
- Some wonders of a bio-computer-scientist (Q2678667) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS (Q5462668) (← links)
- Matrix splicing system (Q5852139) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Networks of splicing processors: simulations between topologies (Q6048242) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)
- Conjugate word blending: formal model and experimental implementation by XPCR (Q6095510) (← links)
- Descriptional Complexity of Semi-Simple Splicing Systems (Q6169897) (← links)
