Travelled to:1 × Austria
1 × Canada
1 × Greece
1 × New Zealand
1 × Sweden
2 × Czech Republic
2 × France
2 × Italy
Collaborated with:C.Epifanio A.Gabriele J.Karhumäki W.Plandowski A.Restivo M.Crochemore P.Séébold J.Shallit M.Sciortino I.Venturini S.Salemi M.Autili P.Inverardi R.Spalazzese M.Tivoli C.Frougny G.Fici A.Langiu T.Lecroq A.Lefebvre É.Prieur-Gaston
Talks about:sturmian (3) languag (3) conjectur (2) mismatch (2) applic (2) graph (2) word (2) antidictionari (1) represent (1) forbidden (1)
Person: Filippo Mignosi
DBLP: Mignosi:Filippo
Contributed to:
2015
2013
20102007200520042001
1999199719971993Wrote 11 papers:
- LATA-2015-AutiliIMST #automation #specification #synthesis
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (MA, PI, FM, RS, MT), pp. 3–24.
- DLT-2013-FiciLLLMP #word
- Abelian Repetitions in Sturmian Words (GF, AL, TL, AL, FM, ÉPG), pp. 227–238.
- CIAA-2010-EpifanioFGMS #graph #lazy evaluation #on the
- On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.
- CIAA-2007-CrochemoreEGM #automaton #on the
- On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.
- DLT-2005-EpifanioGM #approximate
- Languages with Mismatches and an Application to Approximate Indexing (CE, AG, FM), pp. 224–235.
- DLT-2004-EpifanioMSV #graph
- Sturmian Graphs and a Conjecture of Moser (CE, FM, JS, IV), pp. 175–187.
- DLT-2001-MignosiRS #assembly
- Forbidden Factors and Fragment Assembly (FM, AR, MS), pp. 349–358.
- ICALP-1999-CrochemoreMRS #using
- Text Compression Using Antidictionaries (MC, FM, AR, SS), pp. 261–270.
- DLT-1997-KarhumakiPM #bound #constant
- A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.
- ICALP-1997-KarhumakiPM #equation #word
- The Expressibility of Languages and Relations by Word Equations (JK, WP, FM), pp. 98–109.
- ICALP-1993-MignosiS
- If a D0L Language is k-Power Free then it is Circular (FM, PS), pp. 507–518.