Pages that link to "Item:Q4553829"
From MaRDI portal
The following pages link to On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems (Q4553829):
Displaying 6 items.
- Parsimonious computational completeness (Q832917) (← links)
- (Q5867515) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← 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)