The following pages link to (Q4036781):
Displaying 18 items.
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Computing by splicing (Q1349864) (← links)
- Simple splicing systems (Q1392573) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Separating some splicing models. (Q1603389) (← links)
- On the splicing operation (Q1923595) (← links)
- Regularity of splicing languages (Q1923604) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- On the power of circular splicing (Q2565850) (← links)
- Logical string rewriting (Q5941560) (← links)
- Biomolecular realizations of a parallel architecture for solving combinatorial problems (Q5952495) (← links)
- On the regularity of circular splicing languages: a survey and new developments (Q5962067) (← links)
