Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Varricchio, Stefano"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Flavio D'Alessandro
,
Benedetto Intrigila
,
Stefano Varricchio
Theoretical Computer Science
416
, 2012, pp. 1-16
On bounded rational trace languages
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theory of Computing Systems
46
(2), 2010, pp. 351-369
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Flavio D'Alessandro
,
Benedetto Intrigila
,
Stefano Varricchio
Theoretical Computer Science
410
(47-49), 2009, pp. 5158-5181
On the separability of sparse context-free languages and of bounded rational relations
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theoretical Computer Science
381
(1-3), 2007, pp. 274-279
Well quasi-orders generated by a word-shuffle rewriting
Flavio D'Alessandro
,
Gwénaël Richomme
,
Stefano Varricchio
Theoretical Computer Science
377
(1-3), 2007, pp. 73-92
On the structure of the counting function of sparse context-free languages
Flavio D'Alessandro
,
Benedetto Intrigila
,
Stefano Varricchio
Theoretical Computer Science
356
(1-2), 2006, pp. 104-117
Well quasi-orders and context-free grammars
Flavio D'Alessandro
,
Stefano Varricchio
Theoretical Computer Science
327
(3), 2004, pp. 255-268
Words, univalent factors, and boxes
Arturo Carpi
,
Aldo de Luca
,
Stefano Varricchio
Acta Informatica
38
(6), 2001, pp. 409-436
Learning functions represented as multiplicity automata
Amos Beimel
,
Francesco Bergadano
,
Nader H. Bshouty
,
Eyal Kushilevitz
,
Stefano Varricchio
Journal of the ACM
47
(3), 2000, pp. 506-530
On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
Benedetto Intrigila
,
Stefano Varricchio
Acta Informatica
36
(9-10), 2000, pp. 817-835
Some decisional problems on rational relations
Marina Madonia
,
Stefano Varricchio
Theoretical Computer Science
180
(1-2), 1997, pp. 1-15
A pumping condition for regular sets
Stefano Varricchio
SIAM Journal on Computing
26
(3), 1997, pp. 764-771
On the applications of multiplicity automata in learning
Amos Beimel
,
Francesco Bergadano
,
Nader H. Bshouty
,
Eyal Kushilevitz
,
Stefano Varricchio
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 349-358
Well quasi-orders and regular languages
Aldo de Luca
,
Stefano Varricchio
Acta Informatica
31
, 1994, pp. 539-557
A polynomial time algorithm for the equivalence of two morphisms on
\omega
-regular languages
Stefano Varricchio
Lecture Notes in Computer Science
665
, 1993, pp. 595-606
On the regularity of languages on a binary alphabet generated by copying systems
Daniel P. Bovet
,
Stefano Varricchio
Information Processing Letters
44
, 1992, pp. 119-123
Rational series with coefficients in a commutative ring
Stefano Varricchio
Theoretical Computer Science
98
, 1992, pp. 41-50
On the decidability of the equivalence problem for partially commutative rational power series
Stefano Varricchio
Theoretical Computer Science
99
, 1992, pp. 291-299
Some regularity conditions based on well quasi-orders
Aldo de Luca
,
Stefano Varricchio
Lecture Notes in Computer Science
583
, 1992, pp. 356-371
On noncounting regular classes
Aldo de Luca
,
Stefano Varricchio
Theoretical Computer Science
100
, 1992, pp. 67-104
On finitely recognizable semigroups
Aldo de Luca
,
Stefano Varricchio
Acta Informatica
29
, 1992, pp. 483-498
Combinatorial properties of uniformly recurrent words and an application to semigroups
Aldo de Luca
,
Stefano Varricchio
International Journal of Algebra and Computation
1
(2), 1991, pp. 227-245
Finiteness and iteration conditions for semigroups
Aldo de Luca
,
Stefano Varricchio
Theoretical Computer Science
87
, 1991, pp. 315-327
Factorizations of free monoids and unavoidable regularities
Stefano Varricchio
Theoretical Computer Science
73
, 1990, pp. 81-89
On non-counting regular classes
Aldo de Luca
,
Stefano Varricchio
Lecture Notes in Computer Science
443
, 1990, pp. 74-87
Seiten 1
2
>