Pages that link to "Item:Q553921"
From MaRDI portal
The following pages link to Computational power of insertion-deletion (P) systems with rules of size two (Q553921):
Displaying 17 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- Adding matrix control: insertion-deletion systems with substitutions. III (Q831848) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Outfix-guided insertion (Q1682857) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Insertion-deletion systems with substitutions. I (Q2106623) (← links)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975) (← links)
- Circular Post Machines and P Systems with Exo-insertion and Deletion (Q2890284) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- Insertion-deletion systems with substitutions I (Q5037217) (← links)
- (Q5867515) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← links)
- Single semi-contextual insertion-deletion systems (Q6095514) (← links)
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 (Q6135711) (← links)
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) (Q6150989) (← links)
