Pages that link to "Item:Q2789520"
From MaRDI portal
The following pages link to On the commutative equivalence of bounded context-free and regular languages (Q2789520):
Displaying 9 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 commutative context-free languages (Q1092674) (← links)
- Remarks about commutative context-free languages (Q1267720) (← links)
- On sparse languages \(L\) such that \(LL= \Sigma^*\) (Q1331892) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- On the structure of the counting function of sparse context-free languages. (Q2490812) (← links)
- The conjecture of Fliess on commutative context-free languages (Q3476286) (← links)
- ON SPARSE 0L LANGUAGES OVER THE BINARY ALPHABET (Q5053732) (← links)