Pages that link to "Item:Q1034637"
From MaRDI portal
The following pages link to The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637):
Displaying 7 items.
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- Stefano Varricchio (1960-2008) (Q2267786) (← links)
- On the Commutative Equivalence of Algebraic Formal Series and Languages (Q6114824) (← links)
