Stefano Varricchio

Publication Activity (10 Years)

Years Active: 1988-2012
Publications (10 Years): 0

Top Topics

Computer Vision

Linear Complexity

Top Venues

Theor. Comput. Sci.

Publications

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