S. Varricchio

发表

Some combinatorial properties of factorial languages

A. Luca, S. Varricchio, 1990 .

Recognizability of Rectangular Pictures by Wang Systems

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

On uniformly repetitive semigroups

Giuseppe Pirillo, S. Varricchio, G. Pirillo, 1994 .

QUASI-ORDERS , UNAVOIDABLE SETS , AND DERIVATION SYSTEMS

Flavio D'Alessandro, S. Varricchio, 2006 .

Fabrication of multilayered nanofluidic membranes through silicon templates.

S. Varricchio, Hibert Cyrille, B. Arnaud, 2015, Nanoscale.

SOME COMB1 ATORIAL P THUE-MORSE SEQUENCE IN SEMIGROUPS

A. Luca, S. Varricchio, 2001 .

A note on ω-permutable semigroups

A. Luca, S. Varricchio, Stefeno Varricchio, 1990 .

A Finiteness Condition for Semigroups Generalizing a Theorem of Coudrain and Schützenberger

S. Varricchio, A. DeLuca, 1994 .

On Learning Branching Programs and Small Depth Circuits

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

Learning functions represented as multiplicity automata

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

Learning Behaviors of Automata from Multiplicity and Equivalence Queries

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

Multimaterial Nanoporous Membranes Shaped through High Aspect-Ratio Sacrificial Silicon Nanostructures

P. Renaud, S. Varricchio, A. Bertsch, 2017, ACS omega.

Finite automata and non-self-embedding grammars

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

Regularity and Finiteness Conditions

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

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

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

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.

Special Factors and Uniqueness Conditions in Rational Trees

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

Fabrication of clamped-clamped beam resonators with embedded fluidic nanochannel

P. Renaud, S. Varricchio, S. Stassi, 2020 .

Finiteness and Regularity in Semigroups and Formal Languages

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

Finiteness and Iteration Conditions for Semigroups

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

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

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

Well Quasi-orders in Formal Language Theory

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

Well quasi-orders generated by a word-shuffle rewriting

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

Well quasi-orders, unavoidable sets, and derivation systems

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

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.

Avoidable Sets and Well Quasi-Orders

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

Well quasi-orders and context-free grammars

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

On Well Quasi-orders on Languages

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

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 and regular languages

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

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..

Some Regularity Conditions Based on Well Quasi-Orders

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

On Non-Counting Regular Classes

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

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

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

On some counting problems for semi-linear sets pdf

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

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

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

On Noncounting Regular Classes

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

On the Growth of Context-Free Languages

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

Factorizations of Free Monoids and Unaviodable Regularities

S. 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..

A New Unavoidable Regularity in Free Monoids

A. Luca, S. Varricchio, 1993 .

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.