Pages that link to "Item:Q3980380"
From MaRDI portal
The following pages link to How to generate languages using only two pairs of parentheses (Q3980380):
Displaying 10 items.
- Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
- How to produce all sentences from a two-level grammar (Q800100) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975) (← links)
- Normal forms for phrase-structure grammars (Q3991298) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← links)