Pages that link to "Item:Q1892201"
From MaRDI portal
The following pages link to Polynomial size test sets for context-free languages (Q1892201):
Displaying 9 items.
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- More on the power of chain rules in context-free grammars (Q759487) (← links)
- A graph-based regularity test for deterministic context-free languages (Q1177178) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- Lower bounds for context-free grammars (Q1944159) (← links)
- A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- Polynomial size test sets for commutative languages (Q4361579) (← links)
- On the size of independent systems of equations in semigroups (Q5096903) (← links)