The following pages link to (Q4263694):
Displaying 14 items.
- Adding matrix control: insertion-deletion systems with substitutions. III (Q831848) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
- Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States (Q2945880) (← links)
- Further Results on Insertion-Deletion Systems with One-Sided Contexts (Q3540125) (← links)
- On bonded sequential and parallel insertion systems (Q5223612) (← links)
- (Q5867515) (← links)
- Single semi-contextual insertion-deletion systems (Q6095514) (← links)
- When Stars Control a Grammar's Work (Q6204128) (← links)
