Flavio D'Alessandro

Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro: Quantum finite automata and linear context-free languages: a decidable problem. CoRR abs/1303.2967 (2013)

Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro: Regularity of languages defined by formal series with isolated cut point. RAIRO - Theor. Inf. and Applic. 46(4): 479-493 (2012)

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: Quasi-polynomials, linear Diophantine equations and semi-linear sets. Theor. Comput. Sci. 416: 1-16 (2012)

Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro: Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA 2011: 73-87

Arturo Carpi, Flavio D'Alessandro: Independent sets of words and the synchronization problem. CoRR abs/1111.5467 (2011)

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio: On Bounded Rational Trace Languages. Theory Comput. Syst. 46(2): 351-369 (2010)

Arturo Carpi, Flavio D'Alessandro: On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths. Developments in Language Theory 2010: 124-135

Arturo Carpi, Flavio D'Alessandro: Strongly transitive automata and the Cerný conjecture. Acta Inf. 46(8): 591-607 (2009)

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: The Parikh counting functions of sparse context-free languages are quasi-polynomials. Theor. Comput. Sci. 410(47-49): 5158-5181 (2009)

Arturo Carpi, Flavio D'Alessandro: Synchronizing Automata and Independent Systems of Words. ICTCS 2009: 71-74

Arturo Carpi, Flavio D'Alessandro: The Synchronization Problem for Locally Strongly Transitive Automata. MFCS 2009: 211-222

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: On some counting problems for semi-linear sets. CoRR abs/0907.3005 (2009)

Flavio D'Alessandro, Stefano Varricchio: On the Growth of Context-Free Languages. Journal of Automata, Languages and Combinatorics 13(2): 95-104 (2008)

Flavio D'Alessandro, Stefano Varricchio: Well Quasi-orders in Formal Language Theory. Developments in Language Theory 2008: 84-95

Arturo Carpi, Flavio D'Alessandro: The Synchronization Problem for Strongly Transitive Automata. Developments in Language Theory 2008: 240-251

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: The Parikh functions of sparse context-free languages are quasi-polynomials. CoRR abs/0807.0718 (2008)

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio: Well quasi-orders generated by a word-shuffle rewriting. Theor. Comput. Sci. 377(1-3): 73-92 (2007)

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio: On the separability of sparse context-free languages and of bounded rational relations. Theor. Comput. Sci. 381(1-3): 274-279 (2007)

Flavio D'Alessandro, Alessandro D'Andrea: A Non-commutativity Statement for Algebraic Quaternions. IJAC 16(3): 583-602 (2006)

Flavio D'Alessandro, Stefano Varricchio: Well quasi-orders, unavoidable sets, and derivation systems. ITA 40(3): 407-426 (2006)

Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio: On the structure of the counting function of sparse context-free languages. Theor. Comput. Sci. 356(1-2): 104-117 (2006)

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio: Well Quasi Orders and the Shuffle Closure of Finite Sets. Developments in Language Theory 2006: 260-269

Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio: Well quasi-orders and the shuffle closure of finite sets. CoRR abs/cs/0607082 (2006)

Flavio D'Alessandro: Free Groups of Quaternions. IJAC 14(1): 69-86 (2004)

Flavio D'Alessandro, Stefano Varricchio: Well quasi-orders and context-free grammars. Theor. Comput. Sci. 327(3): 255-268 (2004)

Flavio D'Alessandro, Stefano Varricchio: Avoidable Sets and Well Quasi-Orders. Developments in Language Theory 2004: 139-150

Flavio D'Alessandro: On the Complexity of Simon Automata over the Dyck Language. Journal of Automata, Languages and Combinatorics 8(3): 465-476 (2003)

Flavio D'Alessandro, Stefano Varricchio: On Well Quasi-orders on Languages. Developments in Language Theory 2003: 230-241

Flavio D'Alessandro: A combinatorial problem on Trapezoidal words. Theor. Comput. Sci. 273(1-2): 11-33 (2002)

Christian Choffrut, Flavio D'Alessandro: Commutativity in Free Inverse Monoids. Theor. Comput. Sci. 204(1-2): 35-54 (1998)