The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefano Varricchio: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giovanna Melideo, Stefano Varricchio
    Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:87-102 [Conf]
  2. Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio
    Linear Automata, Rational Series and a Theorem of Fine and Wilf. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:157-168 [Conf]
  3. Marina Madonia, Stefano Varricchio
    Iterative Pairs and Multitape Automata. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:17-29 [Conf]
  4. Francesco Bergadano, Stefano Varricchio
    Learning Behaviors of Automata from Multiplicity and Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:54-62 [Conf]
  5. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well Quasi Orders and the Shuffle Closure of Finite Sets. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:260-269 [Conf]
  6. Flavio D'Alessandro, Stefano Varricchio
    On Well Quasi-orders on Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:230-241 [Conf]
  7. Flavio D'Alessandro, Stefano Varricchio
    Avoidable Sets and Well Quasi-Orders. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:139-150 [Conf]
  8. Arturo Carpi, Aldo de Luca, Stefano Varricchio
    Special factors in some combinational structures. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:3-13 [Conf]
  9. Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
    On Learning Programs and Small Depth Circuits. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:150-161 [Conf]
  10. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    On the Applications of Multiplicity Automata in Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:349-358 [Conf]
  11. Aldo de Luca, Stefano Varricchio
    On Non-Counting Regular Classes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:74-87 [Conf]
  12. Aldo de Luca, Stefano Varricchio
    On a Conjecture of Brzozowski. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:465-472 [Conf]
  13. Aldo de Luca, Stefano Varricchio
    Some Regularity Conditions Based on Well Quasi-Orders. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:356-371 [Conf]
  14. Aldo de Luca, Stefano Varricchio
    A finiteness condition for semigroups. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:138-147 [Conf]
  15. Stefano Varricchio
    Bisections of Free Monoids and a New Unavoidable Regularity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:539-541 [Conf]
  16. Stefano Varricchio
    Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:595-606 [Conf]
  17. Francesco Bergadano, Dario Catalano, Stefano Varricchio
    Learning Sat-k-DNF Formulas from Membership Queries. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:126-130 [Conf]
  18. Marcella Anselmo, Dora Giammarresi, Stefano Varricchio
    Finite Automata and Non-self-Embedding Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:47-56 [Conf]
  19. Arturo Carpi, Aldo de Luca, Stefano Varricchio
    Words, univalent factors, and boxes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:6, pp:409-436 [Journal]
  20. Benedetto Intrigila, Stefano Varricchio
    On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2000, v:36, n:9/10, pp:817-835 [Journal]
  21. Aldo de Luca, Stefano Varricchio
    On Finitely Recognizable Semigroups. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:5, pp:483-498 [Journal]
  22. Aldo de Luca, Stefano Varricchio
    Well Quasi-Orders and Regular Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:6, pp:539-557 [Journal]
  23. Aldo de Luca, Stefano Varricchio
    A positive pumping condition for regular sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:39, n:, pp:171-174 [Journal]
  24. Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio
    Learning Multivariate Polynomials from Substitution and Equivalence Queries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:8, pp:- [Journal]
  25. Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
    On Learning Branching Programs and Small Depth Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:9, pp:- [Journal]
  26. Daniel P. Bovet, Stefano Varricchio
    On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:119-123 [Journal]
  27. Aldo de Luca, M. Pelagalli, Stefano Varricchio
    Test Sets for Languages of Infinite Words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:2, pp:91-95 [Journal]
  28. Aldo de Luca, Stefano Varricchio
    On the Factors of the Thue-Morse Word on Three Symbols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:6, pp:281-285 [Journal]
  29. Aldo de Luca, Stefano Varricchio
    Factorial Languages Whose Growth Function is Quadratically Upper Bounded. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:6, pp:283-288 [Journal]
  30. Aldo de Luca, Stefano Varricchio
    A combinatorial theorem on p-power-free words and an application to semigroups. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:205-228 [Journal]
  31. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    Learning functions represented as multiplicity automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:3, pp:506-530 [Journal]
  32. Lucio de Prophetis, Stefano Varricchio
    Recognizability of Rectangular Pictures by Wang Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1997, v:2, n:4, pp:269-0 [Journal]
  33. Arturo Carpi, Aldo de Luca, Stefano Varricchio
    Special Factors and Uniqueness Conditions in Rational Trees. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:4, pp:375-395 [Journal]
  34. Francesco Bergadano, Stefano Varricchio
    Learning Behaviors of Automata from Multiplicity and Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1268-1280 [Journal]
  35. Stefano Varricchio
    A Pumping Condition for Regular Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:764-771 [Journal]
  36. Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
    On the structure of the counting function of sparse context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:104-117 [Journal]
  37. Flavio D'Alessandro, Stefano Varricchio
    Well quasi-orders and context-free grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:3, pp:255-268 [Journal]
  38. Aldo de Luca, Stefano Varricchio
    Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:3, pp:333-348 [Journal]
  39. Aldo de Luca, Stefano Varricchio
    Finiteness and Iteration Conditions for Semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:87, n:2, pp:315-327 [Journal]
  40. Aldo de Luca, Stefano Varricchio
    On Noncounting Regular Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:67-104 [Journal]
  41. Marina Madonia, Stefano Varricchio
    Some Decisional Problems on Rational Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:1-15 [Journal]
  42. Stefano Varricchio
    Factorizations of Free Monoids and Unaviodable Regularities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:73, n:1, pp:81-89 [Journal]
  43. Stefano Varricchio
    Rational Series with Coefficients in a Commutative Ring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:1, pp:41-50 [Journal]
  44. Stefano Varricchio
    On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:2, pp:291-299 [Journal]
  45. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well quasi-orders generated by a word-shuffle rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:73-92 [Journal]
  46. Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
    Well quasi-orders and the shuffle closure of finite sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  47. Giuseppe Pirillo, Stefano Varricchio
    Some combinatorial properties of infinite words and applications to semigroup theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:239-251 [Journal]
  48. Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
    On the separability of sparse context-free languages and of bounded rational relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:274-279 [Journal]

  49. Well Quasi-orders in Formal Language Theory. [Citation Graph (, )][DBLP]


  50. The Parikh functions of sparse context-free languages are quasi-polynomials [Citation Graph (, )][DBLP]


  51. On some counting problems for semi-linear sets [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002