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