Stefano Varricchio

According to our database, Stefano Varricchio authored at least 59 papers between 1988 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Learning Automata.

Stefano Varricchio

Encyclopedia of Algorithms, 2016

2012

Quasi-polynomials, linear Diophantine equations and semi-linear sets.

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

Theor. Comput. Sci., 2012

2010

On Bounded Rational Trace Languages.

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio

Theory Comput. Syst., 2010

2009

The Parikh counting functions of sparse context-free languages are quasi-polynomials.

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

CoRR, 2009

2008

Learning Automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the Growth of Context-Free Languages.

Flavio D'Alessandro, Stefano Varricchio

J. Autom. Lang. Comb., 2008

The Parikh functions of sparse context-free languages are quasi-polynomials

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

CoRR, 2008

Well Quasi-orders in Formal Language Theory.

Flavio D'Alessandro, Stefano Varricchio

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Well quasi-orders generated by a word-shuffle rewriting.

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio

Theor. Comput. Sci., 2007

On the separability of sparse context-free languages and of bounded rational relations.

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio

Theor. Comput. Sci., 2007

2006

On the structure of the counting function of sparse context-free languages.

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio

Theor. Comput. Sci., 2006

Well quasi-orders, unavoidable sets, and derivation systems.

Flavio D'Alessandro, Stefano Varricchio

RAIRO Theor. Informatics Appl., 2006

Well Quasi Orders and the Shuffle Closure of Finite Sets.

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2004

Well quasi-orders and context-free grammars.

Flavio D'Alessandro, Stefano Varricchio

Theor. Comput. Sci., 2004

Avoidable Sets and Well Quasi-Orders.

Flavio D'Alessandro, Stefano Varricchio

Proceedings of the Developments in Language Theory, 2004

2003

On Well Quasi-orders on Languages.

Flavio D'Alessandro, Stefano Varricchio

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Words, univalent factors, and boxes.

Arturo Carpi, Aldo de Luca, Stefano Varricchio

Acta Informatica, 2002

Finite Automata and Non-self-Embedding Grammars.

Marcella Anselmo, Dora Giammarresi, Stefano Varricchio

Proceedings of the Implementation and Application of Automata, 2002

2001

Special Factors and Uniqueness Conditions in Rational Trees.

Arturo Carpi, Aldo de Luca, Stefano Varricchio

Theory Comput. Syst., 2001

2000

Learning functions represented as multiplicity automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

J. ACM, 2000

On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees.

Benedetto Intrigila, Stefano Varricchio

Acta Informatica, 2000

1999

Finiteness and Regularity in Semigroups and Formal Languages

Aldo de Luca, Stefano Varricchio

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-59849-4, 1999

Special factors in some combinational structures.

Arturo Carpi, Aldo de Luca, Stefano Varricchio

Proceedings of the Developments in Language Theory, 1999

Linear Automata, Rational Series and a Theorem of Fine and Wilf.

Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio

Proceedings of the Jewels are Forever, 1999

1998

Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.

Giovanna Melideo, Stefano Varricchio

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Regularity and Finiteness Conditions.

Aldo de Luca, Stefano Varricchio

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Some Decisional Problems on Rational Relations.

Marina Madonia, Stefano Varricchio

Theor. Comput. Sci., 1997

A Pumping Condition for Regular Sets.

Stefano Varricchio

SIAM J. Comput., 1997

Recognizability of Rectangular Pictures by Wang Systems.

Lucio de Prophetis, Stefano Varricchio

J. Autom. Lang. Comb., 1997

On Learning Programs and Small Depth Circuits.

Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Learning Behaviors of Automata from Multiplicity and Equivalence Queries.

Francesco Bergadano, Stefano Varricchio

SIAM J. Comput., 1996

On Learning Branching Programs and Small Depth Circuits

Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio

Electron. Colloquium Comput. Complex., 1996

Learning Multivariate Polynomials from Substitution and Equivalence Queries

Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio

Electron. Colloquium Comput. Complex., 1996

Some combinatorial properties of infinite words and applications to semigroup theory.

Giuseppe Pirillo, Stefano Varricchio

Discret. Math., 1996

Learning Sat-<i>k</i>-DNF Formulas from Membership Queries.

Francesco Bergadano, Dario Catalano, Stefano Varricchio

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

On the Applications of Multiplicity Automata in Learning.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Iterative Pairs and Multitape Automata.

Marina Madonia, Stefano Varricchio

Proceedings of the Trees in Algebra and Programming, 1996

1994

Well Quasi-Orders and Regular Languages.

Aldo de Luca, Stefano Varricchio

Acta Informatica, 1994

On a Conjecture of Brzozowski.

Aldo de Luca, Stefano Varricchio

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.

Stefano Varricchio

Proceedings of the STACS 93, 1993

1992

On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series.

Stefano Varricchio

Theor. Comput. Sci., 1992

Rational Series with Coefficients in a Commutative Ring.

Stefano Varricchio

Theor. Comput. Sci., 1992

On Noncounting Regular Classes.

Aldo de Luca, Stefano Varricchio

Theor. Comput. Sci., 1992

On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.

Daniel P. Bovet, Stefano Varricchio

Inf. Process. Lett., 1992

On Finitely Recognizable Semigroups.

Aldo de Luca, Stefano Varricchio

Acta Informatica, 1992

Some Regularity Conditions Based on Well Quasi-Orders.

Aldo de Luca, Stefano Varricchio

Proceedings of the LATIN '92, 1992

1991

Finiteness and Iteration Conditions for Semigroups.

Aldo de Luca, Stefano Varricchio

Theor. Comput. Sci., 1991

Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups.

Aldo de Luca, Stefano Varricchio

Int. J. Algebra Comput., 1991

1990

Factorizations of Free Monoids and Unaviodable Regularities.

Stefano Varricchio

Theor. Comput. Sci., 1990

A combinatorial theorem on p-power-free words and an application to semigroups.

Aldo de Luca, Stefano Varricchio

RAIRO Theor. Informatics Appl., 1990

On Non-Counting Regular Classes.

Aldo de Luca, Stefano Varricchio

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.

Aldo de Luca, Stefano Varricchio

Theor. Comput. Sci., 1989

Factorial Languages Whose Growth Function is Quadratically Upper Bounded.

Aldo de Luca, Stefano Varricchio

Inf. Process. Lett., 1989

A positive pumping condition for regular sets.

Aldo de Luca, Stefano Varricchio

Bull. EATCS, 1989

1988

On the Factors of the Thue-Morse Word on Three Symbols.

Aldo de Luca, Stefano Varricchio

Inf. Process. Lett., 1988

Test Sets for Languages of Infinite Words.

Aldo de Luca, M. Pelagalli, Stefano Varricchio

Inf. Process. Lett., 1988

Bisections of Free Monoids and a New Unavoidable Regularity.

Stefano Varricchio

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

A finiteness condition for semigroups.

Aldo de Luca, Stefano Varricchio

Proceedings of the Formal Properties of Finite Automata and Applications, 1988