VARRICCHIO, STEFANO
VARRICCHIO, STEFANO
Mostra
records
Risultati 1 - 5 di 5 (tempo di esecuzione: 0.008 secondi).
Finite automata and non-self-embedding grammars
2003-01-01 Anselmo, M; Giammarresi, D; Varricchio, S
On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
2000-01-01 Intrigila, B; Varricchio, S
On the structure of the counting function of sparse context-free languages
2006-01-01 D'Alessandro, F; Intrigila, B; Varricchio, S
Quasi-polynomials, linear Diophantine equations and semi-linear sets
2012-01-01 D'Alessandro, F; Intrigila, B; Varricchio, S
The Parikh counting functions of sparse context-free languages are quasi-polynomials
2009-01-01 D’Alessandro, F; Intrigila, B; Varricchio, S
| Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
|---|---|---|---|---|
| 1-gen-2003 | Finite automata and non-self-embedding grammars | Anselmo, M; Giammarresi, D; Varricchio, S | Intervento a convegno | |
| 1-gen-2000 | On the generalization of Higman and Kruskal's theorems to regular languages and rational trees | Intrigila, B; Varricchio, S | Articolo su rivista | |
| 1-gen-2006 | On the structure of the counting function of sparse context-free languages | D'Alessandro, F; Intrigila, B; Varricchio, S | Articolo su rivista | |
| 1-gen-2012 | Quasi-polynomials, linear Diophantine equations and semi-linear sets | D'Alessandro, F; Intrigila, B; Varricchio, S | Articolo su rivista | |
| 1-gen-2009 | The Parikh counting functions of sparse context-free languages are quasi-polynomials | D’Alessandro, F; Intrigila, B; Varricchio, S | Articolo su rivista |