Pages that link to "Item:Q2490812"
From MaRDI portal
The following pages link to On the structure of the counting function of sparse context-free languages. (Q2490812):
Displaying 15 items.
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- 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 the context-freeness of the set of words containing overlaps (Q845966) (← links)
- On bounded rational trace languages (Q970110) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← 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 counting functions and slenderness of languages (Q2422037) (← links)
- Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422) (← links)
- Semilinearity of Families of Languages (Q5859668) (← links)
- Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
