A Note on the Multiplicative Group of a Division Ring. - Flavio D'Alessandro (Int. J. Algebra Comput., 1997)

Commutativity in Free Inverse Monoids. - Christian Choffrut; Flavio D'Alessandro (Theor. Comput. Sci., 1998)

A combinatorial problem on Trapezoidal words. - Flavio D'Alessandro (Theor. Comput. Sci., 2002)

On Well Quasi-orders on Languages. - Flavio D'Alessandro; Stefano Varricchio (Developments in Language Theory, 2003)

On the Complexity of Simon Automata over the Dyck Language. - Flavio D'Alessandro (J. Autom. Lang. Comb., 2003)

The finite power property in free groups. - Flavio D'Alessandro; Jacques Sakarovitch (Theor. Comput. Sci., 2003)

Avoidable Sets and Well Quasi-Orders. - Flavio D'Alessandro; Stefano Varricchio (Developments in Language Theory, 2004)

Free Groups of Quaternions. - Flavio D'Alessandro (Int. J. Algebra Comput., 2004)

Well quasi-orders and context-free grammars. - Flavio D'Alessandro; Stefano Varricchio (Theor. Comput. Sci., 2004)

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

A Non-commutativity Statement for Algebraic Quaternions. - Flavio D'Alessandro; Alessandro D'Andrea (Int. J. Algebra Comput., 2006)

Well quasi-orders, unavoidable sets, and derivation systems. - Flavio D'Alessandro; Stefano Varricchio (RAIRO Theor. Informatics Appl., 2006)

On the structure of the counting function of sparse context-free languages. - Flavio D'Alessandro; Benedetto Intrigila; Stefano Varricchio (Theor. Comput. Sci., 2006)

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

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

The Synchronization Problem for Strongly Transitive Automata. - Arturo Carpi; Flavio D'Alessandro (Developments in Language Theory, 2008)

Well Quasi-orders in Formal Language Theory. - Flavio D'Alessandro; Stefano Varricchio (Developments in Language Theory, 2008)

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

On the Growth of Context-Free Languages. - Flavio D'Alessandro; Stefano Varricchio (J. Autom. Lang. Comb., 2008)

Synchronizing Automata and Independent Systems of Words. - Arturo Carpi; Flavio D'Alessandro (ICTCS, 2009)

The Synchronization Problem for Locally Strongly Transitive Automata. - Arturo Carpi; Flavio D'Alessandro (MFCS, 2009)

Strongly transitive automata and the Cerný conjecture. - Arturo Carpi; Flavio D'Alessandro (Acta Informatica, 2009)

On some counting problems for semi-linear sets - Flavio D'Alessandro; Benedetto Intrigila; Stefano Varricchio (CoRR, 2009)

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

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

On Bounded Rational Trace Languages. - Christian Choffrut; Flavio D'Alessandro; Stefano Varricchio (Theory Comput. Syst., 2010)

Regularity of languages defined by formal series with isolated cut point. - Alberto Bertoni; Maria Paola Bianchi; Flavio D'Alessandro (RAIRO Theor. Informatics Appl., 2012)

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

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Developments in Language Theory, 2013)

Independent sets of words and the synchronization problem. - Arturo Carpi; Flavio D'Alessandro (Adv. Appl. Math., 2013)

Cerny-like problems for finite sets of words. - Arturo Carpi; Flavio D'Alessandro (ICTCS, 2014)

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Int. J. Found. Comput. Sci., 2014)

On the commutative equivalence of bounded context-free and regular languages: The code case. - Flavio D'Alessandro; Benedetto Intrigila (Theor. Comput. Sci., 2015)

On the commutative equivalence of semi-linear sets of Nk. - Flavio D'Alessandro; Benedetto Intrigila (Theor. Comput. Sci., 2015)

On the commutative equivalence of bounded context-free and regular languages: The semi-linear case. - Flavio D'Alessandro; Benedetto Intrigila (Theor. Comput. Sci., 2015)

Homing vector automata. - Özlem Salehi; A. C. Cem Say; Flavio D'Alessandro (RAIRO Theor. Informatics Appl., 2016)

Generalized Results on Monoids as Memory. - Özlem Salehi; Flavio D'Alessandro; A. C. Cem Say (AFL, 2017)

On incomplete and synchronizing finite sets. - Arturo Carpi; Flavio D'Alessandro (Theor. Comput. Sci., 2017)

On the Commutative Equivalence of Context-Free Languages. - Arturo Carpi; Flavio D'Alessandro (DLT, 2018)

Language classes associated with automata over matrix groups. - Özlem Salehi; Flavio D'Alessandro; A. C. Cem Say (RAIRO Theor. Informatics Appl., 2018)

On the Commutative Equivalence of Bounded Semi-linear Codes. - Arturo Carpi; Flavio D'Alessandro (WORDS, 2019)

Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems. - Arturo Carpi; Flavio D'Alessandro (J. Autom. Lang. Comb., 2019)

Coding by minimal linear grammars. - Arturo Carpi; Flavio D'Alessandro (Theor. Comput. Sci., 2020)

On finite-index indexed grammars and their restrictions. - Flavio D'Alessandro; Oscar H. Ibarra; Ian McQuillan (Inf. Comput., 2021)

On the Commutative Equivalence of Algebraic Formal Series and Languages. - Arturo Carpi; Flavio D'Alessandro (Int. J. Found. Comput. Sci., 2021)

On bounded linear codes and the commutative equivalence. - Arturo Carpi; Flavio D'Alessandro (Theor. Comput. Sci., 2021)

Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. - Arturo Carpi; Flavio D'Alessandro; Oscar H. Ibarra; Ian McQuillan (Theor. Comput. Sci., 2021)

Unboundedness Problems for Machines with Reversal-Bounded Counters. - Pascal Baumann 001; Flavio D'Alessandro; Moses Ganardi; Oscar H. Ibarra; Ian McQuillan; Lia Schütze; Georg Zetzsche (FoSSaCS, 2023)

Quantum Automata and Languages of Finite Index. - Andrea Benso; Flavio D'Alessandro; Paolo Papi (RP, 2024)