| 2008 |
|---|
| 51 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Well Quasi-orders in Formal Language Theory.
Developments in Language Theory 2008: 84-95 |
| 50 | EE | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
Learning Automata.
Encyclopedia of Algorithms 2008 |
| 49 | EE | Flavio D'Alessandro,
Benedetto Intrigila,
Stefano Varricchio:
The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR abs/0807.0718: (2008) |
| 2007 |
|---|
| 48 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci. 377(1-3): 73-92 (2007) |
| 47 | EE | Christian Choffrut,
Flavio D'Alessandro,
Stefano Varricchio:
On the separability of sparse context-free languages and of bounded rational relations.
Theor. Comput. Sci. 381(1-3): 274-279 (2007) |
| 2006 |
|---|
| 46 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets.
Developments in Language Theory 2006: 260-269 |
| 45 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets
CoRR abs/cs/0607082: (2006) |
| 44 | EE | Flavio D'Alessandro,
Benedetto Intrigila,
Stefano Varricchio:
On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci. 356(1-2): 104-117 (2006) |
| 2004 |
|---|
| 43 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Avoidable Sets and Well Quasi-Orders.
Developments in Language Theory 2004: 139-150 |
| 42 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Well quasi-orders and context-free grammars.
Theor. Comput. Sci. 327(3): 255-268 (2004) |
| 2003 |
|---|
| 41 | EE | Flavio D'Alessandro,
Stefano Varricchio:
On Well Quasi-orders on Languages.
Developments in Language Theory 2003: 230-241 |
| 2002 |
|---|
| 40 | EE | Marcella Anselmo,
Dora Giammarresi,
Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars.
CIAA 2002: 47-56 |
| 39 | EE | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Words, univalent factors, and boxes.
Acta Inf. 38(6): 409-436 (2002) |
| 2001 |
|---|
| 38 | EE | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst. 34(4): 375-395 (2001) |
| 2000 |
|---|
| 37 | EE | Benedetto Intrigila,
Stefano Varricchio:
On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees.
Acta Inf. 36(9/10): 817-835 (2000) |
| 36 | EE | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
Learning functions represented as multiplicity automata.
J. ACM 47(3): 506-530 (2000) |
| 1999 |
|---|
| 35 | | Arturo Carpi,
Aldo de Luca,
Stefano Varricchio:
Special factors in some combinational structures.
Developments in Language Theory 1999: 3-13 |
| 34 | | Giovanna Melideo,
Cesidia Pasquarelli,
Stefano Varricchio:
Linear Automata, Rational Series and a Theorem of Fine and Wilf.
Jewels are Forever 1999: 157-168 |
| 1998 |
|---|
| 33 | EE | Giovanna Melideo,
Stefano Varricchio:
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.
ALT 1998: 87-102 |
| 1997 |
|---|
| 32 | | Francesco Bergadano,
Nader H. Bshouty,
Christino Tamon,
Stefano Varricchio:
On Learning Programs and Small Depth Circuits.
EuroCOLT 1997: 150-161 |
| 31 | | Lucio de Prophetis,
Stefano Varricchio:
Recognizability of Rectangular Pictures by Wang Systems.
Journal of Automata, Languages and Combinatorics 2(4): 269- (1997) |
| 30 | | Stefano Varricchio:
A Pumping Condition for Regular Sets.
SIAM J. Comput. 26(3): 764-771 (1997) |
| 29 | EE | Marina Madonia,
Stefano Varricchio:
Some Decisional Problems on Rational Relations.
Theor. Comput. Sci. 180(1-2): 1-15 (1997) |
| 1996 |
|---|
| 28 | | Marina Madonia,
Stefano Varricchio:
Iterative Pairs and Multitape Automata.
CAAP 1996: 17-29 |
| 27 | | Amos Beimel,
Francesco Bergadano,
Nader H. Bshouty,
Eyal Kushilevitz,
Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning.
FOCS 1996: 349-358 |
| 26 | EE | Francesco Bergadano,
Dario Catalano,
Stefano Varricchio:
Learning Sat-k-DNF Formulas from Membership Queries.
STOC 1996: 126-130 |
| 25 | EE | Giuseppe Pirillo,
Stefano Varricchio:
Some combinatorial properties of infinite words and applications to semigroup theory.
Discrete Mathematics 153(1-3): 239-251 (1996) |
| 24 | EE | Francesco Bergadano,
Nader H. Bshouty,
Stefano Varricchio:
Learning Multivariate Polynomials from Substitution and Equivalence Queries
Electronic Colloquium on Computational Complexity (ECCC) 3(8): (1996) |
| 23 | EE | Francesco Bergadano,
Nader H. Bshouty,
Christino Tamon,
Stefano Varricchio:
On Learning Branching Programs and Small Depth Circuits
Electronic Colloquium on Computational Complexity (ECCC) 3(9): (1996) |
| 22 | | Francesco Bergadano,
Stefano Varricchio:
Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
SIAM J. Comput. 25(6): 1268-1280 (1996) |
| 1994 |
|---|
| 21 | | Francesco Bergadano,
Stefano Varricchio:
Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
CIAC 1994: 54-62 |
| 20 | | Aldo de Luca,
Stefano Varricchio:
On a Conjecture of Brzozowski.
IFIP Congress (1) 1994: 465-472 |
| 19 | | Aldo de Luca,
Stefano Varricchio:
Well Quasi-Orders and Regular Languages.
Acta Inf. 31(6): 539-557 (1994) |
| 1993 |
|---|
| 18 | | Stefano Varricchio:
Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.
STACS 1993: 595-606 |
| 1992 |
|---|
| 17 | | Aldo de Luca,
Stefano Varricchio:
Some Regularity Conditions Based on Well Quasi-Orders.
LATIN 1992: 356-371 |
| 16 | | Aldo de Luca,
Stefano Varricchio:
On Finitely Recognizable Semigroups.
Acta Inf. 29(5): 483-498 (1992) |
| 15 | | Daniel P. Bovet,
Stefano Varricchio:
On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.
Inf. Process. Lett. 44(3): 119-123 (1992) |
| 14 | | Aldo de Luca,
Stefano Varricchio:
On Noncounting Regular Classes.
Theor. Comput. Sci. 100(1): 67-104 (1992) |
| 13 | | Stefano Varricchio:
Rational Series with Coefficients in a Commutative Ring.
Theor. Comput. Sci. 98(1): 41-50 (1992) |
| 12 | | Stefano Varricchio:
On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series.
Theor. Comput. Sci. 99(2): 291-299 (1992) |
| 1991 |
|---|
| 11 | | Aldo de Luca,
Stefano Varricchio:
Finiteness and Iteration Conditions for Semigroups.
Theor. Comput. Sci. 87(2): 315-327 (1991) |
| 1990 |
|---|
| 10 | | Aldo de Luca,
Stefano Varricchio:
On Non-Counting Regular Classes.
ICALP 1990: 74-87 |
| 9 | | Aldo de Luca,
Stefano Varricchio:
A combinatorial theorem on p-power-free words and an application to semigroups.
ITA 24: 205-228 (1990) |
| 8 | | Stefano Varricchio:
Factorizations of Free Monoids and Unaviodable Regularities.
Theor. Comput. Sci. 73(1): 81-89 (1990) |
| 1989 |
|---|
| 7 | | Aldo de Luca,
Stefano Varricchio:
A positive pumping condition for regular sets.
Bulletin of the EATCS 39: 171-174 (1989) |
| 6 | | Aldo de Luca,
Stefano Varricchio:
Factorial Languages Whose Growth Function is Quadratically Upper Bounded.
Inf. Process. Lett. 30(6): 283-288 (1989) |
| 5 | | Aldo de Luca,
Stefano Varricchio:
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.
Theor. Comput. Sci. 63(3): 333-348 (1989) |
| 1988 |
|---|
| 4 | | Aldo de Luca,
Stefano Varricchio:
A finiteness condition for semigroups.
Formal Properties of Finite Automata and Applications 1988: 138-147 |
| 3 | | Stefano Varricchio:
Bisections of Free Monoids and a New Unavoidable Regularity.
MFCS 1988: 539-541 |
| 2 | | Aldo de Luca,
Stefano Varricchio:
On the Factors of the Thue-Morse Word on Three Symbols.
Inf. Process. Lett. 27(6): 281-285 (1988) |
| 1 | | Aldo de Luca,
M. Pelagalli,
Stefano Varricchio:
Test Sets for Languages of Infinite Words.
Inf. Process. Lett. 29(2): 91-95 (1988) |
