2008 |
43 | EE | Maxime Crochemore,
Alessandra Gabriele,
Filippo Mignosi,
Mauriana Pesaresi:
On the Longest Common Factor Problem.
IFIP TCS 2008: 143-155 |
2007 |
42 | EE | Maxime Crochemore,
Chiara Epifanio,
Alessandra Gabriele,
Filippo Mignosi:
On the Suffix Automaton with Mismatches.
CIAA 2007: 144-156 |
41 | EE | Chiara Epifanio,
Filippo Mignosi,
Jeffrey Shallit,
Ilaria Venturini:
On Sturmian graphs.
Discrete Applied Mathematics 155(8): 1014-1030 (2007) |
40 | EE | Chiara Epifanio,
Alessandra Gabriele,
Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Languages with mismatches.
Theor. Comput. Sci. 385(1-3): 152-166 (2007) |
2006 |
39 | EE | Gabriele Fici,
Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Word assembly through minimal forbidden words.
Theor. Comput. Sci. 359(1-3): 214-230 (2006) |
2005 |
38 | EE | Chiara Epifanio,
Alessandra Gabriele,
Filippo Mignosi:
Languages with Mismatches and an Application to Approximate Indexing.
Developments in Language Theory 2005: 224-235 |
37 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Filippo Mignosi:
Minimal Forbidden Patterns of Multi-Dimensional Shifts.
IJAC 15(1): 73-93 (2005) |
36 | EE | Aldo de Luca,
Filippo Mignosi,
Dominique Perrin,
Grzegorz Rozenberg:
Preface.
Theor. Comput. Sci. 340(1): 179-185 (2005) |
35 | EE | Chiara Epifanio,
Filippo Mignosi:
A multidimensional critical factorization theorem.
Theor. Comput. Sci. 346(2-3): 265-280 (2005) |
2004 |
34 | EE | Maxime Crochemore,
Chiara Epifanio,
Roberto Grossi,
Filippo Mignosi:
A Trie-Based Approach for Compacting Automata.
CPM 2004: 145-158 |
33 | EE | Chiara Epifanio,
Filippo Mignosi,
Jeffrey Shallit,
Ilaria Venturini:
Sturmian Graphs and a Conjecture of Moser.
Developments in Language Theory 2004: 175-187 |
2003 |
32 | EE | Alessandra Gabriele,
Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Indexing Structures for Approximate String Matching.
CIAC 2003: 140-151 |
31 | EE | Marie-Pierre Béal,
Maxime Crochemore,
Filippo Mignosi:
Computing forbidden words of regular languages.
Fundam. Inform. 56(1-2): 121-135 (2003) |
30 | EE | Chiara Epifanio,
Michel Koskas,
Filippo Mignosi:
On a conjecture on bidimensional words.
Theor. Comput. Sci. 1-3(299): 123-150 (2003) |
29 | | Filippo Mignosi,
Antonio Restivo,
Pedro V. Silva:
On Fine and Wilf's theorem for bidimensional words.
Theor. Comput. Sci. 292(1): 245-262 (2003) |
28 | EE | Sabin Cautis,
Filippo Mignosi,
Jeffrey Shallit,
Ming-wei Wang,
Soroosh Yazdani:
Periodicity, morphisms, and matrices.
Theor. Comput. Sci. 295: 107-121 (2003) |
2002 |
27 | EE | Filippo Mignosi,
Luca Q. Zamboni:
A Note on a Conjecture of Duval and Sturmian Words.
ITA 36(1): 1-3 (2002) |
26 | EE | Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Words and forbidden factors.
Theor. Comput. Sci. 273(1-2): 99-117 (2002) |
2001 |
25 | EE | Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Forbidden Factors and Fragment Assembly.
Developments in Language Theory 2001: 349-358 |
24 | EE | Filippo Mignosi,
Jeffrey Shallit,
Ming-wei Wang:
Variations on a Theorem of Fine & Wilf.
MFCS 2001: 512-523 |
23 | EE | Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Forbidden Factors and Fragment Assembly.
ITA 35(6): 565-577 (2001) |
22 | EE | Jean-Pierre Duval,
Filippo Mignosi,
Antonio Restivo:
Recurrence and periodicity in infinite words from local periods.
Theor. Comput. Sci. 262(1): 269-284 (2001) |
2000 |
21 | EE | Juhani Karhumäki,
Filippo Mignosi,
Wojciech Plandowski:
The expressibility of languages and relations by word equations.
J. ACM 47(3): 483-505 (2000) |
1999 |
20 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo,
Sergio Salemi:
Text Compression Using Antidictionaries.
ICALP 1999: 261-270 |
19 | | Filippo Mignosi,
Antonio Restivo,
Marinella Sciortino:
Forbidden Factors in Finite and Infinite Words.
Jewels are Forever 1999: 339-350 |
18 | EE | Maria Gabriella Castelli,
Filippo Mignosi,
Antonio Restivo:
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words.
Theor. Comput. Sci. 218(1): 83-94 (1999) |
1998 |
17 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo:
Minimal Forbidden Words and Factor Automata.
MFCS 1998: 665-673 |
16 | EE | Maxime Crochemore,
Filippo Mignosi,
Antonio Restivo:
Automata and Forbidden Words.
Inf. Process. Lett. 67(3): 111-117 (1998) |
15 | EE | Filippo Mignosi,
Antonio Restivo,
Sergio Salemi:
Periodicity and the Golden Ratio.
Theor. Comput. Sci. 204(1-2): 153-167 (1998) |
14 | EE | Dora Giammarresi,
Sabrina Mantaci,
Filippo Mignosi,
Antonio Restivo:
Periodicities on Trees.
Theor. Comput. Sci. 205(1-2): 145-181 (1998) |
1997 |
13 | | Juhani Karhumäki,
Wojciech Plandowski,
Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture.
Developments in Language Theory 1997: 103-118 |
12 | | Juhani Karhumäki,
Wojciech Plandowski,
Filippo Mignosi:
The Expressibility of Languages and Relations by Word Equations.
ICALP 1997: 98-109 |
1996 |
11 | | Marie-Pierre Béal,
Filippo Mignosi,
Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics.
STACS 1996: 555-566 |
1995 |
10 | | Filippo Mignosi,
Antonio Restivo,
Sergio Salemi:
A Periodicity Theorem on Words and Applications.
MFCS 1995: 337-348 |
1994 |
9 | | Raffaele Giancarlo,
Filippo Mignosi:
Generalizations of the Periodicity Theorem of Fine and Wilf.
CAAP 1994: 130-141 |
8 | | Dora Giammarresi,
Sabrina Mantaci,
Filippo Mignosi,
Antonio Restivo:
A Periodicity Theorem for Trees.
IFIP Congress (1) 1994: 473-478 |
7 | | Aldo de Luca,
Filippo Mignosi:
Some Combinatorial Properties of Sturmian Words.
Theor. Comput. Sci. 136(2): 361-285 (1994) |
1993 |
6 | | Filippo Mignosi,
Patrice Séébold:
If a D0L Language is k-Power Free then it is Circular.
ICALP 1993: 507-518 |
5 | | Antonio Machi,
Filippo Mignosi:
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups.
SIAM J. Discrete Math. 6(1): 44-56 (1993) |
1992 |
4 | | Filippo Mignosi,
Giuseppe Pirillo:
Repetitions in the Fibonacci infinite word.
ITA 26: 199-204 (1992) |
1991 |
3 | | Filippo Mignosi:
On the Number of Factors of Sturmian Words.
Theor. Comput. Sci. 82(1): 71-84 (1991) |
1990 |
2 | | Filippo Mignosi:
Sturmian Words and Ambigous Context-Free Languages.
Int. J. Found. Comput. Sci. 1(3): 309-324 (1990) |
1989 |
1 | | Filippo Mignosi:
Infinite Words with Linear Subword Complexity.
Theor. Comput. Sci. 65(2): 221-242 (1989) |