Pages that link to "Item:Q2384399"
From MaRDI portal
The following pages link to Finite turns and the regular closure of linear context-free languages (Q2384399):
Displaying 10 items.
- Context-dependent nondeterminism for pushdown automata (Q880177) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- Kernels of Sub-classes of Context-Free Languages (Q3297763) (← links)
- On Extended Regular Expressions (Q3618588) (← links)
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems (Q4553829) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 (Q6135711) (← links)
