Stefano Varricchio

61 papers A* 3A 1B 3C 7Journal 38Unranked 5
YearRankTypeTitle / Venue / Authors
2016 — ch.
Learning Automata.
Encyclopedia of Algorithms
Stefano Varricchio
2012 J jnl
Quasi-polynomials, linear Diophantine equations and semi-linear sets.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2010 J jnl
On Bounded Rational Trace Languages.
Theory Comput. Syst.
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
2009 J jnl
On some counting problems for semi-linear sets
CoRR
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2009 J jnl
The Parikh counting functions of sparse context-free languages are quasi-polynomials.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2008 — ch.
Learning Automata.
Encyclopedia of Algorithms
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2008 J jnl
On the Growth of Context-Free Languages.
J. Autom. Lang. Comb.
Flavio D'Alessandro, Stefano Varricchio
2008 J jnl
The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2008 C conf
Well Quasi-orders in Formal Language Theory.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2007 J jnl
On the separability of sparse context-free languages and of bounded rational relations.
Theor. Comput. Sci.
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
2007 J jnl
Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci.
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2006 C conf
Well Quasi Orders and the Shuffle Closure of Finite Sets.
Developments in Language Theory
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
Well quasi-orders and the shuffle closure of finite sets
CoRR
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
Well quasi-orders, unavoidable sets, and derivation systems.
RAIRO Theor. Informatics Appl.
Flavio D'Alessandro, Stefano Varricchio
2004 C conf
Avoidable Sets and Well Quasi-Orders.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2004 J jnl
Well quasi-orders and context-free grammars.
Theor. Comput. Sci.
Flavio D'Alessandro, Stefano Varricchio
2003 C conf
On Well Quasi-orders on Languages.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2002 C conf
Finite Automata and Non-self-Embedding Grammars.
CIAA
Marcella Anselmo, Dora Giammarresi, Stefano Varricchio
2002 J jnl
Words, univalent factors, and boxes.
Acta Informatica
Arturo Carpi, Aldo de Luca, Stefano Varricchio
2001 J jnl
Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst.
Arturo Carpi, Aldo de Luca, Stefano Varricchio
2000 J jnl
Learning functions represented as multiplicity automata.
J. ACM
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2000 J jnl
On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees.
Acta Informatica
Benedetto Intrigila, Stefano Varricchio
1999 — book
Finiteness and Regularity in Semigroups and Formal Languages
Aldo de Luca, Stefano Varricchio
1999 — conf
Linear Automata, Rational Series and a Theorem of Fine and Wilf.
Jewels are Forever
Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio
1999 C conf
Special factors in some combinational structures.
Developments in Language Theory
Arturo Carpi, Aldo de Luca, Stefano Varricchio
1998 B conf
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.
ALT
Giovanna Melideo, Stefano Varricchio
1997 J jnl
A Pumping Condition for Regular Sets.
SIAM J. Comput.
Stefano Varricchio
1997 — conf
On Learning Programs and Small Depth Circuits.
EuroCOLT
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
1997 J jnl
Recognizability of Rectangular Pictures by Wang Systems.
J. Autom. Lang. Comb.
Lucio de Prophetis, Stefano Varricchio
1997 — ch.
Regularity and Finiteness Conditions.
Handbook of Formal Languages (1)
Aldo de Luca, Stefano Varricchio
1997 J jnl
Some Decisional Problems on Rational Relations.
Theor. Comput. Sci.
Marina Madonia, Stefano Varricchio
1996 — conf
Iterative Pairs and Multitape Automata.
CAAP
Marina Madonia, Stefano Varricchio
1996 J jnl
Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
SIAM J. Comput.
Francesco Bergadano, Stefano Varricchio
1996 J jnl
Learning Multivariate Polynomials from Substitution and Equivalence Queries
Electron. Colloquium Comput. Complex.
Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio
1996 A* conf
Learning Sat-
STOC
Francesco Bergadano, Dario Catalano, Stefano Varricchio
1996 J jnl
On Learning Branching Programs and Small Depth Circuits
Electron. Colloquium Comput. Complex.
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
1996 A* conf
On the Applications of Multiplicity Automata in Learning.
FOCS
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
1996 J jnl
Some combinatorial properties of infinite words and applications to semigroup theory.
Discret. Math.
Giuseppe Pirillo, Stefano Varricchio
1994 C conf
Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
CIAC
Francesco Bergadano, Stefano Varricchio
1994 — conf
On a Conjecture of Brzozowski.
IFIP Congress (1)
Aldo de Luca, Stefano Varricchio
1994 J jnl
Well Quasi-Orders and Regular Languages.
Acta Informatica
Aldo de Luca, Stefano Varricchio
1993 A conf
Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.
STACS
Stefano Varricchio
1992 J jnl
On Finitely Recognizable Semigroups.
Acta Informatica
Aldo de Luca, Stefano Varricchio
1992 J jnl
On Noncounting Regular Classes.
Theor. Comput. Sci.
Aldo de Luca, Stefano Varricchio
1992 J jnl
On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series.
Theor. Comput. Sci.
Stefano Varricchio
1992 J jnl
On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.
Inf. Process. Lett.
Daniel P. Bovet, Stefano Varricchio
1992 J jnl
Rational Series with Coefficients in a Commutative Ring.
Theor. Comput. Sci.
Stefano Varricchio
1992 B conf
Some Regularity Conditions Based on Well Quasi-Orders.
LATIN
Aldo de Luca, Stefano Varricchio
1991 J jnl
Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups.
Int. J. Algebra Comput.
Aldo de Luca, Stefano Varricchio
1991 J jnl
Finiteness and Iteration Conditions for Semigroups.
Theor. Comput. Sci.
Aldo de Luca, Stefano Varricchio
1990 J jnl
A combinatorial theorem on p-power-free words and an application to semigroups.
RAIRO Theor. Informatics Appl.
Aldo de Luca, Stefano Varricchio
1990 J jnl
Factorizations of Free Monoids and Unaviodable Regularities.
Theor. Comput. Sci.
Stefano Varricchio
1990 A* conf
On Non-Counting Regular Classes.
ICALP
Aldo de Luca, Stefano Varricchio
1989 J jnl
A positive pumping condition for regular sets.
Bull. EATCS
Aldo de Luca, Stefano Varricchio
1989 J jnl
Factorial Languages Whose Growth Function is Quadratically Upper Bounded.
Inf. Process. Lett.
Aldo de Luca, Stefano Varricchio
1989 J jnl
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.
Theor. Comput. Sci.
Aldo de Luca, Stefano Varricchio
1988 — conf
A finiteness condition for semigroups.
Formal Properties of Finite Automata and Applications
Aldo de Luca, Stefano Varricchio
1988 B conf
Bisections of Free Monoids and a New Unavoidable Regularity.
MFCS
Stefano Varricchio
1988 J jnl
On the Factors of the Thue-Morse Word on Three Symbols.
Inf. Process. Lett.
Aldo de Luca, Stefano Varricchio
1988 J jnl
Test Sets for Languages of Infinite Words.
Inf. Process. Lett.
Aldo de Luca, M. Pelagalli, Stefano Varricchio