Pages that link to "Item:Q2358685"
From MaRDI portal
The following pages link to On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685):
Displaying 8 items.
- Parsimonious computational completeness (Q832917) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Computational completeness of path-structured graph-controlled insertion-deletion systems (Q2399250) (← links)
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems (Q4553829) (← links)
- Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← links)
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) (Q6150989) (← links)
- When Stars Control a Grammar's Work (Q6204128) (← links)
