default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Varricchio
Person information
- affiliation: Università di Roma Tor Vergata, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[r2]Stefano Varricchio:
Learning Automata. Encyclopedia of Algorithms 2016: 1066-1070- 2012
- [j33]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
Quasi-polynomials, linear Diophantine equations and semi-linear sets. Theor. Comput. Sci. 416: 1-16 (2012) - 2010
- [j32]Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio:
On Bounded Rational Trace Languages. Theory Comput. Syst. 46(2): 351-369 (2010)
2000 – 2009
- 2009
- [j31]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): 5158-5181 (2009) - [i5]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
On some counting problems for semi-linear sets. CoRR abs/0907.3005 (2009) - 2008
- [j30]Flavio D'Alessandro, Stefano Varricchio:
On the Growth of Context-Free Languages. J. Autom. Lang. Comb. 13(2): 95-104 (2008) - [c19]Flavio D'Alessandro, Stefano Varricchio:
Well Quasi-orders in Formal Language Theory. Developments in Language Theory 2008: 84-95 - [r1]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning Automata. Encyclopedia of Algorithms 2008 - [i4]Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:
The Parikh functions of sparse context-free languages are quasi-polynomials. CoRR abs/0807.0718 (2008) - 2007
- [j29]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. 377(1-3): 73-92 (2007) - [j28]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): 274-279 (2007) - 2006
- [j27]Flavio D'Alessandro, Stefano Varricchio:
Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theor. Informatics Appl. 40(3): 407-426 (2006) - [j26]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): 104-117 (2006) - [c18]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory 2006: 260-269 - [i3]Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets. CoRR abs/cs/0607082 (2006) - 2004
- [j25]Flavio D'Alessandro, Stefano Varricchio:
Well quasi-orders and context-free grammars. Theor. Comput. Sci. 327(3): 255-268 (2004) - [c17]Flavio D'Alessandro, Stefano Varricchio:
Avoidable Sets and Well Quasi-Orders. Developments in Language Theory 2004: 139-150 - 2003
- [c16]Flavio D'Alessandro, Stefano Varricchio:
On Well Quasi-orders on Languages. Developments in Language Theory 2003: 230-241 - 2002
- [j24]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Words, univalent factors, and boxes. Acta Informatica 38(6): 409-436 (2002) - [c15]Marcella Anselmo, Dora Giammarresi, Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars. CIAA 2002: 47-56 - 2001
- [j23]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special Factors and Uniqueness Conditions in Rational Trees. Theory Comput. Syst. 34(4): 375-395 (2001) - 2000
- [j22]Benedetto Intrigila, Stefano Varricchio:
On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees. Acta Informatica 36(9/10): 817-835 (2000) - [j21]Amos Beimel, Francesco Bergadano
, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000)
1990 – 1999
- 1999
- [b1]Aldo de Luca, Stefano Varricchio:
Finiteness and Regularity in Semigroups and Formal Languages. Monographs in Theoretical Computer Science. An EATCS Series, Springer 1999, ISBN 978-3-540-63771-4, pp. I-X, 1-242 - [c14]Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio:
Linear Automata, Rational Series and a Theorem of Fine and Wilf. Jewels are Forever 1999: 157-168 - [c13]Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special factors in some combinational structures. Developments in Language Theory 1999: 3-13 - 1998
- [c12]Giovanna Melideo, Stefano Varricchio:
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. ALT 1998: 87-102 - 1997
- [j20]Lucio de Prophetis, Stefano Varricchio:
Recognizability of Rectangular Pictures by Wang Systems. J. Autom. Lang. Comb. 2(4): 269-288 (1997) - [j19]Stefano Varricchio:
A Pumping Condition for Regular Sets. SIAM J. Comput. 26(3): 764-771 (1997) - [j18]Marina Madonia, Stefano Varricchio:
Some Decisional Problems on Rational Relations. Theor. Comput. Sci. 180(1-2): 1-15 (1997) - [c11]Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio:
On Learning Programs and Small Depth Circuits. EuroCOLT 1997: 150-161 - [p1]Aldo de Luca, Stefano Varricchio:
Regularity and Finiteness Conditions. Handbook of Formal Languages (1) 1997: 747-810 - 1996
- [j17]Giuseppe Pirillo, Stefano Varricchio:
Some combinatorial properties of infinite words and applications to semigroup theory. Discret. Math. 153(1-3): 239-251 (1996) - [j16]Francesco Bergadano, Stefano Varricchio:
Learning Behaviors of Automata from Multiplicity and Equivalence Queries. SIAM J. Comput. 25(6): 1268-1280 (1996) - [c10]Marina Madonia, Stefano Varricchio:
Iterative Pairs and Multitape Automata. CAAP 1996: 17-29 - [c9]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358 - [c8]Francesco Bergadano, Dario Catalano, Stefano Varricchio:
Learning Sat-k-DNF Formulas from Membership Queries. STOC 1996: 126-130 - [i2]Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio:
Learning Multivariate Polynomials from Substitution and Equivalence Queries. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio:
On Learning Branching Programs and Small Depth Circuits. Electron. Colloquium Comput. Complex. TR96 (1996) - 1994
- [j15]Aldo de Luca, Stefano Varricchio:
Well Quasi-Orders and Regular Languages. Acta Informatica 31(6): 539-557 (1994) - [c7]Francesco Bergadano, Stefano Varricchio:
Learning Behaviors of Automata from Multiplicity and Equivalence Queries. CIAC 1994: 54-62 - [c6]Aldo de Luca, Stefano Varricchio:
On a Conjecture of Brzozowski. IFIP Congress (1) 1994: 465-472 - 1993
- [c5]Stefano Varricchio:
Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages. STACS 1993: 595-606 - 1992
- [j14]Aldo de Luca, Stefano Varricchio:
On Finitely Recognizable Semigroups. Acta Informatica 29(5): 483-498 (1992) - [j13]Daniel P. Bovet, Stefano Varricchio:
On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. Inf. Process. Lett. 44(3): 119-123 (1992) - [j12]Stefano Varricchio:
Rational Series with Coefficients in a Commutative Ring. Theor. Comput. Sci. 98(1): 41-50 (1992) - [j11]Stefano Varricchio:
On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series. Theor. Comput. Sci. 99(2): 291-299 (1992) - [j10]Aldo de Luca, Stefano Varricchio:
On Noncounting Regular Classes. Theor. Comput. Sci. 100(1): 67-104 (1992) - [c4]Aldo de Luca, Stefano Varricchio:
Some Regularity Conditions Based on Well Quasi-Orders. LATIN 1992: 356-371 - 1991
- [j9]Aldo de Luca, Stefano Varricchio:
Combinatorial Properties of uniformly Recurrent Words and an Application to Semigroups. Int. J. Algebra Comput. 1(2): 227-246 (1991) - [j8]Aldo de Luca, Stefano Varricchio:
Finiteness and Iteration Conditions for Semigroups. Theor. Comput. Sci. 87(2): 315-327 (1991) - 1990
- [j7]Aldo de Luca, Stefano Varricchio:
A combinatorial theorem on p-power-free words and an application to semigroups. RAIRO Theor. Informatics Appl. 24: 205-228 (1990) - [j6]Stefano Varricchio:
Factorizations of Free Monoids and Unaviodable Regularities. Theor. Comput. Sci. 73(1): 81-89 (1990) - [c3]Aldo de Luca, Stefano Varricchio:
On Non-Counting Regular Classes. ICALP 1990: 74-87
1980 – 1989
- 1989
- [j5]Aldo de Luca, Stefano Varricchio:
A positive pumping condition for regular sets. Bull. EATCS 39: 171-174 (1989) - [j4]Aldo de Luca, Stefano Varricchio:
Factorial Languages Whose Growth Function is Quadratically Upper Bounded. Inf. Process. Lett. 30(6): 283-288 (1989) - [j3]Aldo de Luca, Stefano Varricchio:
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups. Theor. Comput. Sci. 63(3): 333-348 (1989) - 1988
- [j2]Aldo de Luca, Stefano Varricchio:
On the Factors of the Thue-Morse Word on Three Symbols. Inf. Process. Lett. 27(6): 281-285 (1988) - [j1]Aldo de Luca, M. Pelagalli, Stefano Varricchio:
Test Sets for Languages of Infinite Words. Inf. Process. Lett. 29(2): 91-95 (1988) - [c2]Aldo de Luca, Stefano Varricchio:
A finiteness condition for semigroups. Formal Properties of Finite Automata and Applications 1988: 138-147 - [c1]Stefano Varricchio:
Bisections of Free Monoids and a New Unavoidable Regularity. MFCS 1988: 539-541
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
