• 43 Citations
  • 4 h-Index
20022016
If you made any changes in Pure these will be visible here soon.

Research Output 2004 2016

Filter
Article
2016
3 Citations (Scopus)

Linear-size suffix tries

Epifanio, C., Mignosi, F., Grossi, R. & Crochemore, M., 2016, In : Theoretical Computer Science. 638, p. 171-178 8 p.

Research output: Contribution to journalArticle

Suffix
Data structures
Labels
Compaction
Suffix Tree
2012
2 Citations (Scopus)

Sturmian graphs and integer representations over numeration systems

Epifanio, C., Mignosi, F., Shallit & Frougny, 2012, In : Discrete Applied Mathematics. 160, p. 536-547 12 p.

Research output: Contribution to journalArticle

2009
2 Citations (Scopus)

From Nerode’s congruence to suffix automata with mismatches

Gabriele, A., Epifanio, C., Mignosi, F. & Crochemore, M., 2009, In : Theoretical Computer Science. 410, p. 3471-3480 10 p.

Research output: Contribution to journalArticle

Suffix
Congruence
Automata
Deterministic Finite Automata
Finite automata
2007
6 Citations (Scopus)

Languages with mismatches

Restivo, A., Mignosi, F., Sciortino, M., Gabriele, A., Epifanio, C. & Mignosi, F., 2007, In : Theoretical Computer Science. 385, p. 152-166 15 p.

Research output: Contribution to journalArticle

Data structures
Data Structures
Strings
Approximate String Matching
Indexing
6 Citations (Scopus)

On Sturmian Graphs

Mignosi, F., Epifanio, C., Mignosi, F., Shallit, J. & Venturini, I., 2007, In : Discrete Applied Mathematics. 155, p. 1014-1030 17 p.

Research output: Contribution to journalArticle

Sturmian Words
Graph in graph theory
Counting
Continued Fraction Expansion
Analogy
2005
1 Citation (Scopus)

A Multidimensional Critical Factorization Theorem

Mignosi, F. & Epifanio, C., 2005, In : Theoretical Computer Science. 346, p. 265-280 16 p.

Research output: Contribution to journalArticle

Factorization Theorem
Factorization
Periodicity
Combinatorics on Words
Tightness