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):
Displayed 6 items.
- 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)
- Stefano Varricchio (1960-2008) (Q2267786) (← links)
- Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422) (← links)