Stefano Varricchio

发表

On the Growth of Context-Free Languages

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2008, J. Autom. Lang. Comb..

Finite Automata and Non-Self-Embedding Grammars. Champarnaud J.-M-, Mauriel d.(Eds.)

Marcella Anselmo, Dora Giammarresi, Stefano Varricchio, 2003 .

Avoidable Sets and Well Quasi-Orders

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2004, Developments in Language Theory.

Combinatorics on Words

Aldo de Luca, Stefano Varricchio, 2013 .

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

Aldo de Luca, Stefano Varricchio, A. Luca, 1989, Theor. Comput. Sci..

Factorizations of Free Monoids and Unaviodable Regularities

Stefano Varricchio, 1990, Theor. Comput. Sci..

Some combinatorial properties of infinite words and applications to semigroup theory

Giuseppe Pirillo, Stefano Varricchio, S. Varricchio, 1996, Discret. Math..

Well quasi-orders, unavoidable sets, and derivation systems

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2006, RAIRO Theor. Informatics Appl..

Factorial Languages Whose Growth Function is Quadratically Upper Bounded

Aldo de Luca, Stefano Varricchio, 1989, Inf. Process. Lett..

Well Quasi Orders and the Shuffle Closure of Finite Sets pdf

Gwénaël Richomme, Flavio D'Alessandro, Stefano Varricchio, 2006, Developments in Language Theory.

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

Stefano Varricchio, Giovanna Melideo, Cesidia Pasquarelli, 1999, Jewels are Forever.

Well quasi-orders and regular languages

Aldo de Luca, Stefano Varricchio, A. Luca, 1994, Acta Informatica.

Well quasi-orders generated by a word-shuffle rewriting

Gwénaël Richomme, Flavio D'Alessandro, Stefano Varricchio, 2007, Theor. Comput. Sci..

Strategic Diagnostic Cityscape S.A. 1

Stefano Varricchio, Arthur Trigueiro Baptista, Gilles Roulet, 2010 .

On Non-Counting Regular Classes

Aldo de Luca, Stefano Varricchio, A. Luca, 1990, ICALP.

Special Factors and Uniqueness Conditions in Rational Trees

Aldo de Luca, Stefano Varricchio, Arturo Carpi, 2001, Theory of Computing Systems.

On a Conjecture of Brzozowski

Aldo de Luca, Stefano Varricchio, 1994, IFIP Congress.

Regularity and Finiteness Conditions

Aldo de Luca, Stefano Varricchio, A. Luca, 1997, Handbook of Formal Languages.

Learning Behaviors of Automata from Multiplicity and Equivalence Queries

Francesco Bergadano, Stefano Varricchio, 1996, SIAM J. Comput..

Some Decisional Problems on Rational Relations

Maria Madonia, Stefano Varricchio, 1997, Theor. Comput. Sci..

Iterative Pairs and Multitape Automata

Maria Madonia, Stefano Varricchio, 1996, CAAP.

On Noncounting Regular Classes

Aldo de Luca, Stefano Varricchio, A. Luca, 1992, Theor. Comput. Sci..

Finiteness and Regularity in Semigroups and Formal Languages

Aldo de Luca, Stefano Varricchio, A. Luca, 1999, Monographs in Theoretical Computer Science An EATCS Series.

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

Stefano Varricchio, Giovanna Melideo, 1998, ALT.

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

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2009, Theor. Comput. Sci..

A finiteness condition for semigroups

Aldo de Luca, Stefano Varricchio, 1988, Formal Properties of Finite Automata and Applications.

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

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio, 2007, Theor. Comput. Sci..

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

Stefano Varricchio, 1993, STACS.

Learning Automata

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 2008, Encyclopedia of Algorithms.

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

Aldo de Luca, Stefano Varricchio, 1988, Inf. Process. Lett..

Some Regularity Conditions Based on Well Quasi-Orders

Aldo de Luca, Stefano Varricchio, A. Luca, 1992, LATIN.

On some counting problems for semi-linear sets pdf

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2009, ArXiv.

Well quasi-orders and context-free grammars

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2004, Theor. Comput. Sci..

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

Stefano Varricchio, 1992, Theor. Comput. Sci..

Bisections of Free Monoids and a New Unavoidable Regularity

Stefano Varricchio, 1988, MFCS.

Finiteness and Iteration Conditions for Semigroups

Aldo de Luca, Stefano Varricchio, A. Luca, 1991, Theor. Comput. Sci..

On Well Quasi-orders on Languages

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2003, Developments in Language Theory.

Special factors in some combinational structures

Aldo de Luca, Stefano Varricchio, Arturo Carpi, 1999, Developments in Language Theory.

Learning Sat-k-DNF formulas from membership queries

Francesco Bergadano, Dario Catalano, Stefano Varricchio, 1996, STOC '96.

Recognizability of Rectangular Pictures by Wang Systems

Stefano Varricchio, Lucio de Prophetis, S. Varricchio, 1998, J. Autom. Lang. Comb..

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

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2012, Theor. Comput. Sci..

On Bounded Rational Trace Languages

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio, 2010, Theory of Computing Systems.

Learning Behaviors of Automata from Multiplicity and Equivalence Queries

Francesco Bergadano, Stefano Varricchio, S. Varricchio, 1994, SIAM J. Comput..

A Pumping Condition for Regular Sets

Stefano Varricchio, 1997, SIAM J. Comput..

Test Sets for Languages of Infinite Words

Aldo de Luca, Stefano Varricchio, M. Pelagalli, 1988, Inf. Process. Lett..

On the generalization of Higman and Kruskal's theorems to regular languages and rational trees

Benedetto Intrigila, Stefano Varricchio, B. Intrigila, 2000, Acta Informatica.

Well Quasi-orders in Formal Language Theory

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2008, Developments in Language Theory.

On finitely recognizable semigroups

Aldo de Luca, Stefano Varricchio, 2005, Acta Informatica.

Learning Automata

Stefano Varricchio, 2016, Encyclopedia of Algorithms.

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

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2008, ArXiv.

Rational Series with Coefficients in a Commutative Ring

Stefano Varricchio, 1992, Theor. Comput. Sci..

Words, univalent factors, and boxes

Aldo de Luca, Stefano Varricchio, Arturo Carpi, 2002, Acta Informatica.

Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups

Aldo de Luca, Stefano Varricchio, 1991, Int. J. Algebra Comput..

On the applications of multiplicity automata in learning

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Learning functions represented as multiplicity automata

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 2000, JACM.

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

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2006, Theor. Comput. Sci..

Learning Multivariate Polynomials from Substitution and Equivalence Queries

Nader H. Bshouty, Francesco Bergadano, Stefano Varricchio, 1996, Electron. Colloquium Comput. Complex..

On Learning Programs and Small Depth Circuits

Nader H. Bshouty, Christino Tamon, Francesco Bergadano, 1997, EuroCOLT.

On Learning Branching Programs and Small Depth Circuits

Christino Tamon, Nader H. Bshouty, Francesco Bergadano, 1996, Electron. Colloquium Comput. Complex..

A positive pumping condition for regular sets

Aldo de Luca, Stefano Varricchio, 1989, Bull. EATCS.

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

Aldo de Luca, Stefano Varricchio, 1990, RAIRO Theor. Informatics Appl..

Finite automata and non-self-embedding grammars

Marcella Anselmo, Dora Giammarresi, Stefano Varricchio, 2002, CIAA'02.

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

Stefano Varricchio, Daniel P. Bovet, D. P. Bovet, 1992, Inf. Process. Lett..