Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Filippo Mignosi
2010 – today
- 2013
[j30]Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013)
[c22]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston: Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238- 2012
[j29]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: Sturmian graphs and integer representations over numeration systems. Discrete Applied Mathematics 160(4-5): 536-547 (2012)
[j28]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo: Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012)
[j27]Filippo Mignosi, Antonio Restivo: Characteristic Sturmian words are extremal for the Critical Factorization Theorem. Theor. Comput. Sci. 454: 199-205 (2012)
[i3]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston: Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012)
[i2]Maxime Crochemore, Alessio Langiu, Filippo Mignosi: The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012)
[i1]Maxime Crochemore, Alessio Langiu, Filippo Mignosi: Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012)- 2011
[c21]Dany Breslauer, Roberto Grossi, Filippo Mignosi: Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183- 2010
[c20]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo: Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403
[c19]Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: On Lazy Representations and Sturmian Graphs. CIAA 2010: 125-134
2000 – 2009
- 2009
[j26]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi: From Nerode's congruence to suffix automata with mismatches. Theor. Comput. Sci. 410(37): 3471-3480 (2009)- 2008
[c18]Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi: On the Longest Common Factor Problem. IFIP TCS 2008: 143-155- 2007
[j25]Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini: On Sturmian graphs. Discrete Applied Mathematics 155(8): 1014-1030 (2007)
[j24]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Languages with mismatches. Theor. Comput. Sci. 385(1-3): 152-166 (2007)
[c17]Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi: On the Suffix Automaton with Mismatches. CIAA 2007: 144-156- 2006
[j23]Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006)- 2005
[j22]Marie-Pierre Béal, Francesca Fiorenzi, Filippo Mignosi: Minimal Forbidden Patterns of Multi-Dimensional Shifts. IJAC 15(1): 73-93 (2005)
[j21]Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg: Preface. Theor. Comput. Sci. 340(1): 179-185 (2005)
[j20]Chiara Epifanio, Filippo Mignosi: A multidimensional critical factorization theorem. Theor. Comput. Sci. 346(2-3): 265-280 (2005)
[c16]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi: Languages with Mismatches and an Application to Approximate Indexing. Developments in Language Theory 2005: 224-235- 2004
[c15]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi: A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158
[c14]Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini: Sturmian Graphs and a Conjecture of Moser. Developments in Language Theory 2004: 175-187- 2003
[j19]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Computing forbidden words of regular languages. Fundam. Inform. 56(1-2): 121-135 (2003)
[j18]Chiara Epifanio, Michel Koskas, Filippo Mignosi: On a conjecture on bidimensional words. Theor. Comput. Sci. 1-3(299): 123-150 (2003)
[j17]Filippo Mignosi, Antonio Restivo, Pedro V. Silva: On Fine and Wilf's theorem for bidimensional words. Theor. Comput. Sci. 292(1): 245-262 (2003)
[j16]Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang, Soroosh Yazdani: Periodicity, morphisms, and matrices. Theor. Comput. Sci. 295: 107-121 (2003)
[c13]Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Indexing Structures for Approximate String Matching. CIAC 2003: 140-151- 2002
[j15]Filippo Mignosi, Luca Q. Zamboni: A Note on a Conjecture of Duval and Sturmian Words. ITA 36(1): 1-3 (2002)
[j14]Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Words and forbidden factors. Theor. Comput. Sci. 273(1-2): 99-117 (2002)- 2001
[j13]Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Forbidden Factors and Fragment Assembly. ITA 35(6): 565-577 (2001)
[j12]Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo: Recurrence and periodicity in infinite words from local periods. Theor. Comput. Sci. 262(1): 269-284 (2001)
[c12]Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Forbidden Factors and Fragment Assembly. Developments in Language Theory 2001: 349-358
[c11]Filippo Mignosi, Jeffrey Shallit, Ming-wei Wang: Variations on a Theorem of Fine & Wilf. MFCS 2001: 512-523- 2000
[j11]Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski: The expressibility of languages and relations by word equations. J. ACM 47(3): 483-505 (2000)
1990 – 1999
- 1999
[j10]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)
[c10]Filippo Mignosi, Antonio Restivo, Marinella Sciortino: Forbidden Factors in Finite and Infinite Words. Jewels are Forever 1999: 339-350
[c9]Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi: Text Compression Using Antidictionaries. ICALP 1999: 261-270- 1998
[j9]Maxime Crochemore, Filippo Mignosi, Antonio Restivo: Automata and Forbidden Words. Inf. Process. Lett. 67(3): 111-117 (1998)
[j8]Filippo Mignosi, Antonio Restivo, Sergio Salemi: Periodicity and the Golden Ratio. Theor. Comput. Sci. 204(1-2): 153-167 (1998)
[j7]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo: Periodicities on Trees. Theor. Comput. Sci. 205(1-2): 145-181 (1998)
[c8]Maxime Crochemore, Filippo Mignosi, Antonio Restivo: Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673- 1997
[c7]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi: A lower bound for a constant in Shallit's conjecture. Developments in Language Theory 1997: 103-118
[c6]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi: The Expressibility of Languages and Relations by Word Equations. ICALP 1997: 98-109- 1996
[c5]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo: Minimal Forbidden Words and Symbolic Dynamics. STACS 1996: 555-566- 1995
[c4]Filippo Mignosi, Antonio Restivo, Sergio Salemi: A Periodicity Theorem on Words and Applications. MFCS 1995: 337-348- 1994
[j6]Aldo de Luca, Filippo Mignosi: Some Combinatorial Properties of Sturmian Words. Theor. Comput. Sci. 136(2): 361-285 (1994)
[c3]Raffaele Giancarlo, Filippo Mignosi: Generalizations of the Periodicity Theorem of Fine and Wilf. CAAP 1994: 130-141
[c2]Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo: A Periodicity Theorem for Trees. IFIP Congress (1) 1994: 473-478- 1993
[j5]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)
[c1]Filippo Mignosi, Patrice Séébold: If a D0L Language is k-Power Free then it is Circular. ICALP 1993: 507-518- 1992
[j4]Filippo Mignosi, Giuseppe Pirillo: Repetitions in the Fibonacci infinite word. ITA 26: 199-204 (1992)- 1991
[j3]Filippo Mignosi: On the Number of Factors of Sturmian Words. Theor. Comput. Sci. 82(1): 71-84 (1991)- 1990
[j2]Filippo Mignosi: Sturmian Words and Ambigous Context-Free Languages. Int. J. Found. Comput. Sci. 1(3): 309-324 (1990)
1980 – 1989
- 1989
[j1]Filippo Mignosi: Infinite Words with Linear Subword Complexity. Theor. Comput. Sci. 65(2): 221-242 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:40 CEST by the dblp team



