Pages that link to "Item:Q2829975"
From MaRDI portal
The following pages link to Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975):
Displaying 3 items.
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems (Q4553829) (← links)
