Flavio D'Alessandro

发表

On the Growth of Context-Free Languages

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2008, J. Autom. Lang. Comb..

The finite power property in free groups

Jacques Sakarovitch, Flavio D'Alessandro, Flavio D'Alessandro, 2003, Theor. Comput. Sci..

Avoidable Sets and Well Quasi-Orders

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2004, Developments in Language Theory.

A Non-commutativity Statement for Algebraic Quaternions

Flavio D'Alessandro, Alessandro D'Andrea, 2006, Int. J. Algebra Comput..

On incomplete and synchronizing finite sets

Flavio D'Alessandro, Arturo Carpi, 2017, Theor. Comput. Sci..

On the commutative equivalence of bounded context-free and regular languages: The semi-linear case

Benedetto Intrigila, Flavio D'Alessandro, B. Intrigila, 2015, Theor. Comput. Sci..

Well quasi-orders, unavoidable sets, and derivation systems

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2006, RAIRO Theor. Informatics Appl..

Well Quasi Orders and the Shuffle Closure of Finite Sets pdf

Gwénaël Richomme, Flavio D'Alessandro, Stefano Varricchio, 2006, Developments in Language Theory.

Cerny-like problems for finite sets of words

Flavio D'Alessandro, Arturo Carpi, 2014, ICTCS.

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths

Flavio D'Alessandro, Arturo Carpi, 2010, Developments in Language Theory.

Well quasi-orders generated by a word-shuffle rewriting

Gwénaël Richomme, Flavio D'Alessandro, Stefano Varricchio, 2007, Theor. Comput. Sci..

Commutativity in Free Inverse Monoids

Christian Choffrut, Flavio D'Alessandro, Flavio D'Alessandro, 1998, Theor. Comput. Sci..

Homing vector automata

Flavio D'Alessandro, Özlem Salehi, A. C. Cem Say, 2015, RAIRO Theor. Informatics Appl..

Free Groups of Quaternions

Flavio D'Alessandro, 2004, Int. J. Algebra Comput..

On the Commutative Equivalence of Context-Free Languages

Flavio D'Alessandro, Arturo Carpi, Flavio D'Alessandro, 2018, DLT.

On the commutative equivalence of bounded context-free and regular languages: The code case

Benedetto Intrigila, Flavio D'Alessandro, B. Intrigila, 2015, Theor. Comput. Sci..

A combinatorial problem on Trapezoidal words

Flavio D'Alessandro, 2002, Theor. Comput. Sci..

The Parikh counting functions of sparse context-free languages are quasi-polynomials

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2009, Theor. Comput. Sci..

The Synchronization Problem for Strongly Transitive Automata

Flavio D'Alessandro, Arturo Carpi, 2008, Developments in Language Theory.

A Note on the Multiplicative Group of a Division Ring

Flavio D'Alessandro, 1997, Int. J. Algebra Comput..

On the separability of sparse context-free languages and of bounded rational relations

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio, 2007, Theor. Comput. Sci..

On the commutative equivalence of semi-linear sets of Nk

Benedetto Intrigila, Flavio D'Alessandro, B. Intrigila, 2015, Theor. Comput. Sci..

The Synchronization Problem for Locally Strongly Transitive Automata

Flavio D'Alessandro, Arturo Carpi, Flavio D'Alessandro, 2009, MFCS.

Generalized Results on Monoids as Memory

A. C. Cem Say, Flavio D'Alessandro, Özlem Salehi, 2017, AFL.

On some counting problems for semi-linear sets pdf

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2009, ArXiv.

Well quasi-orders and context-free grammars

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2004, Theor. Comput. Sci..

On the Complexity of Simon Automata over the Dyck Language

Flavio D'Alessandro, 2003, J. Autom. Lang. Comb..

On Well Quasi-orders on Languages

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2003, Developments in Language Theory.

Regularity of languages defined by formal series with isolated cut point

Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro, 2012, RAIRO Theor. Informatics Appl..

Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems

Flavio D'Alessandro, Arturo Carpi, 2019, J. Autom. Lang. Comb..

Quasi-polynomials, linear Diophantine equations and semi-linear sets

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2012, Theor. Comput. Sci..

On Bounded Rational Trace Languages

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio, 2010, Theory of Computing Systems.

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages

Christian Choffrut, Flavio D'Alessandro, Alberto Bertoni, 2014, Int. J. Found. Comput. Sci..

Proceedings 8th International Conference Words 2011: On the commutative equivalence of bounded context-free and regular languages

Benedetto Intrigila, Flavio D'Alessandro, B. Intrigila, 2011 .

Well Quasi-orders in Formal Language Theory

Flavio D'Alessandro, Stefano Varricchio, Flavio D'Alessandro, 2008, Developments in Language Theory.

Language classes associated with automata over matrix groups pdf

Flavio D'Alessandro, Özlem Salehi, A. C. Cem Say, 2016, NCMA.

The Parikh functions of sparse context-free languages are quasi-polynomials pdf

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2008, ArXiv.

Coding by minimal linear grammars

Flavio D'Alessandro, Arturo Carpi, Flavio D'Alessandro, 2020, Theor. Comput. Sci..

On the Commutative Equivalence of Bounded Semi-linear Codes

Flavio D'Alessandro, Arturo Carpi, Flavio D'Alessandro, 2019, WORDS.

Synchronizing Automata and Independent Systems of Words

Flavio D'Alessandro, Arturo Carpi, 2009, ICTCS.

On the structure of the counting function of sparse context-free languages

Benedetto Intrigila, Flavio D'Alessandro, Stefano Varricchio, 2006, Theor. Comput. Sci..

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem pdf

Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro, 2013, Developments in Language Theory.

Independent sets of words and the synchronization problem

Flavio D'Alessandro, Arturo Carpi, 2013, Adv. Appl. Math..

On Finite-Index Indexed Grammars and Their Restrictions pdf

Oscar H. Ibarra, Ian McQuillan, Flavio D'Alessandro, 2016, LATA.

Strongly transitive automata and the Černý conjecture

Flavio D'Alessandro, Arturo Carpi, 2009, Acta Informatica.

On finite-index indexed grammars and their restrictions

Oscar H. Ibarra, Ian McQuillan, Flavio D'Alessandro, 2021, Inf. Comput..

Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

Oscar H. Ibarra, Ian McQuillan, Flavio D'Alessandro, 2020, Theor. Comput. Sci..

On the Commutative Equivalence of Algebraic Formal Series and Languages

Flavio D'Alessandro, Arturo Carpi, Flavio D'Alessandro, 2021, Int. J. Found. Comput. Sci..