Pages that link to "Item:Q674912"
From MaRDI portal
The following pages link to A decision method for Parikh slenderness of context-free languages (Q674912):
Displayed 6 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- Min of Mat is not necessarily Mat (Q1606988) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On Parikh slender context-free languages (Q5941095) (← links)