Pages that link to "Item:Q3517111"
From MaRDI portal
The following pages link to On minimal context-free insertion-deletion systems (Q3517111):
Displaying 21 items.
- Computational power of insertion-deletion (P) systems with rules of size two (Q553921) (← links)
- P systems with minimal insertion and deletion (Q616500) (← links)
- Contextual insertions/deletions and computability (Q675056) (← links)
- Matrix insertion-deletion systems (Q714867) (← links)
- Context-free insertion-deletion systems (Q1763721) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- Insertion-deletion systems with substitutions. I (Q2106623) (← links)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
- Random context and semi-conditional insertion-deletion systems (Q2805451) (← links)
- Circular Post Machines and P Systems with Exo-insertion and Deletion (Q2890284) (← links)
- Parikh Images of Matrix Ins-Del Systems (Q2988822) (← links)
- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality (Q3618619) (← links)
- Minimal context in regenerative \(IL\)-systems (Q3984706) (← links)
- (Q5003076) (← links)
- Insertion-deletion systems with substitutions I (Q5037217) (← links)
- (Q5867515) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← 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)
