Pages that link to "Item:Q685373"
From MaRDI portal
The following pages link to Efficient constructions of test sets for regular and context-free languages (Q685373):
Displaying 10 items.
- On test sets for checking morphism equivalence on languages with fair distribution of letters (Q1061491) (← links)
- A graph-based regularity test for deterministic context-free languages (Q1177178) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← links)
- Polynomial size test sets for context-free languages (Q1892201) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- Parikh test sets for commutative languages (Q3526415) (← links)
- Polynomial size test sets for commutative languages (Q4361579) (← links)