Earthquake-induced landslide scenarios for seismic microzonation: Application to the Accumoli area (Rieti, Italy) S Martino, S Battaglia, F D’alessandro, M Della Seta, C Esposito, ... Bulletin of Earthquake Engineering 18, 5655-5673, 2020 | 34 | 2020 |

Strongly transitive automata and the Cernę conjecture A Carpi, F D'alessandro Acta Informatica 46 (8), 591, 2009 | 29 | 2009 |

On the structure of the counting function of sparse context-free languages F D’Alessandro, B Intrigila, S Varricchio Theoretical computer science 356 (1-2), 104-117, 2006 | 29 | 2006 |

The synchronization problem for locally strongly transitive automata A Carpi, F D’Alessandro Mathematical Foundations of Computer Science 2009: 34th International …, 2009 | 22 | 2009 |

On the hybrid Černę-road coloring problem and Hamiltonian paths A Carpi, F D’Alessandro Developments in Language Theory: 14th International Conference, DLT 2010 …, 2010 | 20 | 2010 |

A combinatorial property for semigroups of matrices F d’Alessandro, E Pasku Semigroup Forum 67 (1), 22-30, 2003 | 19 | 2003 |

The synchronization problem for strongly transitive automata A Carpi, F D’Alessandro Developments in Language Theory: 12th International Conference, DLT 2008 …, 2008 | 18 | 2008 |

A combinatorial problem on trapezoidal words F D'Alessandro Theoretical computer science 273 (1-2), 11-33, 2002 | 17 | 2002 |

The Parikh counting functions of sparse context-free languages are quasi-polynomials F D’Alessandro, B Intrigila, S Varricchio Theoretical computer science 410 (47-49), 5158-5181, 2009 | 15 | 2009 |

On the commutative equivalence of semi-linear sets of Nk F D'Alessandro, B Intrigila Theoretical Computer Science 562, 476-495, 2015 | 12 | 2015 |

Teoria degli automi finiti A De Luca, F D'Alessandro Springer Science & Business Media, 2013 | 12 | 2013 |

On the commutative equivalence of bounded context-free and regular languages: the semi-linear case F D'Alessandro, B Intrigila Theoretical Computer Science 572, 1-24, 2015 | 11 | 2015 |

On the commutative equivalence of bounded context-free and regular languages: the code case F D'Alessandro, B Intrigila Theoretical Computer Science 562, 304-319, 2015 | 11 | 2015 |

On well quasi-orders on languages F D’Alessandro, S Varricchio Developments in Language Theory: 7th International Conference, DLT 2003 …, 2003 | 11 | 2003 |

On incomplete and synchronizing finite sets A Carpi, F D'Alessandro Theoretical Computer Science 664, 67-77, 2017 | 10 | 2017 |

Well quasi-orders and context-free grammars F D'Alessandro, S Varricchio Theoretical Computer Science 327 (3), 255-268, 2004 | 10 | 2004 |

Commutativity in free inverse monoids C Choffrut, F D'Alessandro Theoretical computer science 204 (1-2), 35-54, 1998 | 10 | 1998 |

On the commutative equivalence of context-free languages A Carpi, F D’Alessandro Developments in Language Theory: 22nd International Conference, DLT 2018 …, 2018 | 9 | 2018 |

Unboundedness Problems for Machines with Reversal-Bounded Counters. P Baumann, F D'Alessandro, M Ganardi, OH Ibarra, I McQuillan, ... FoSSaCS, 240-264, 2023 | 8 | 2023 |

On finite-index indexed grammars and their restrictions F D’Alessandro, OH Ibarra, I McQuillan International Conference on Language and Automata Theory and Applications …, 2017 | 8 | 2017 |