Stefano Varricchio

According to our database1, Stefano Varricchio
  • authored at least 60 papers between 1988 and 2016.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 




Learning Automata.
Encyclopedia of Algorithms, 2016

Quasi-polynomials, linear Diophantine equations and semi-linear sets.
Theor. Comput. Sci., 2012

On Bounded Rational Trace Languages.
Theory Comput. Syst., 2010

The Parikh counting functions of sparse context-free languages are quasi-polynomials.
Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets
CoRR, 2009

Learning Automata.
Proceedings of the Encyclopedia of Algorithms, 2008

On the Growth of Context-Free Languages.
Journal of Automata, Languages and Combinatorics, 2008

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

Well Quasi-orders in Formal Language Theory.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci., 2007

On the separability of sparse context-free languages and of bounded rational relations.
Theor. Comput. Sci., 2007

On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci., 2006

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

Well quasi-orders and the shuffle closure of finite sets
CoRR, 2006

Well Quasi Orders and the Shuffle Closure of Finite Sets.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Well quasi-orders and context-free grammars.
Theor. Comput. Sci., 2004

Avoidable Sets and Well Quasi-Orders.
Proceedings of the Developments in Language Theory, 2004

On Well Quasi-orders on Languages.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Words, univalent factors, and boxes.
Acta Inf., 2002

Finite Automata and Non-self-Embedding Grammars.
Proceedings of the Implementation and Application of Automata, 2002

Special Factors and Uniqueness Conditions in Rational Trees.
Theory Comput. Syst., 2001

Learning functions represented as multiplicity automata.
J. ACM, 2000

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

Finiteness and Regularity in Semigroups and Formal Languages
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-59849-4, 1999

Special factors in some combinational structures.
Proceedings of the Developments in Language Theory, 1999

Linear Automata, Rational Series and a Theorem of Fine and Wilf.
Proceedings of the Jewels are Forever, 1999

Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

Some Decisional Problems on Rational Relations.
Theor. Comput. Sci., 1997

A Pumping Condition for Regular Sets.
SIAM J. Comput., 1997

Recognizability of Rectangular Pictures by Wang Systems.
Journal of Automata, Languages and Combinatorics, 1997

On Learning Programs and Small Depth Circuits.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
SIAM J. Comput., 1996

On Learning Branching Programs and Small Depth Circuits
Electronic Colloquium on Computational Complexity (ECCC), 1996

Learning Multivariate Polynomials from Substitution and Equivalence Queries
Electronic Colloquium on Computational Complexity (ECCC), 1996

Some combinatorial properties of infinite words and applications to semigroup theory.
Discrete Mathematics, 1996

Learning Sat-k-DNF Formulas from Membership Queries.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

On the Applications of Multiplicity Automata in Learning.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Iterative Pairs and Multitape Automata.
Proceedings of the Trees in Algebra and Programming, 1996

Well Quasi-Orders and Regular Languages.
Acta Inf., 1994

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

Learning Behaviors of Automata from Multiplicity and Equivalence Queries.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages.
Proceedings of the STACS 93, 1993

On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series.
Theor. Comput. Sci., 1992

Rational Series with Coefficients in a Commutative Ring.
Theor. Comput. Sci., 1992

On Noncounting Regular Classes.
Theor. Comput. Sci., 1992

On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems.
Inf. Process. Lett., 1992

On Finitely Recognizable Semigroups.
Acta Inf., 1992

Some Regularity Conditions Based on Well Quasi-Orders.
Proceedings of the LATIN '92, 1992

Finiteness and Iteration Conditions for Semigroups.
Theor. Comput. Sci., 1991

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

Factorizations of Free Monoids and Unaviodable Regularities.
Theor. Comput. Sci., 1990

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

On Non-Counting Regular Classes.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups.
Theor. Comput. Sci., 1989

Factorial Languages Whose Growth Function is Quadratically Upper Bounded.
Inf. Process. Lett., 1989

A positive pumping condition for regular sets.
Bulletin of the EATCS, 1989

On the Factors of the Thue-Morse Word on Three Symbols.
Inf. Process. Lett., 1988

Test Sets for Languages of Infinite Words.
Inf. Process. Lett., 1988

Bisections of Free Monoids and a New Unavoidable Regularity.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

A finiteness condition for semigroups.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988