Flavio D'Alessandro

64 papers B 2C 9Journal 46Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Commutative Equivalence of Algebraic Structures and Related Problems.
J. Autom. Lang. Comb.
Andrea Benso, Arturo Carpi, Flavio D'Alessandro
2024 — conf
Quantum Automata and Languages of Finite Index.
RP
Andrea Benso, Flavio D'Alessandro, Paolo Papi
2024 J jnl
Quantum automata and languages of finite index.
CoRR
Andrea Benso, Flavio D'Alessandro, Paolo Papi
2023 B conf
Unboundedness Problems for Machines with Reversal-Bounded Counters.
FoSSaCS
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
2023 J jnl
Unboundedness problems for machines with reversal-bounded counters.
CoRR
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
2022 J jnl
Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Regularity.
CoRR
Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2021 J jnl
On bounded linear codes and the commutative equivalence.
Theor. Comput. Sci.
Arturo Carpi, Flavio D'Alessandro
2021 J jnl
On finite-index indexed grammars and their restrictions.
Inf. Comput.
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2021 J jnl
On the Commutative Equivalence of Algebraic Formal Series and Languages.
Int. J. Found. Comput. Sci.
Arturo Carpi, Flavio D'Alessandro
2021 J jnl
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity.
Theor. Comput. Sci.
Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2020 J jnl
Coding by minimal linear grammars.
Theor. Comput. Sci.
Arturo Carpi, Flavio D'Alessandro
2019 J jnl
Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems.
J. Autom. Lang. Comb.
Arturo Carpi, Flavio D'Alessandro
2019 — conf
On the Commutative Equivalence of Bounded Semi-linear Codes.
WORDS
Arturo Carpi, Flavio D'Alessandro
2018 J jnl
Language Classes Associated With Automata Over Matrix Groups.
CoRR
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2018 J jnl
Language classes associated with automata over matrix groups.
RAIRO Theor. Informatics Appl.
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2018 C conf
On the Commutative Equivalence of Context-Free Languages.
DLT
Arturo Carpi, Flavio D'Alessandro
2017 — conf
Generalized Results on Monoids as Memory.
AFL
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2017 C conf
On Finite-Index Indexed Grammars and Their Restrictions.
LATA
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2017 J jnl
On incomplete and synchronizing finite sets.
Theor. Comput. Sci.
Arturo Carpi, Flavio D'Alessandro
2016 J jnl
Homing vector automata.
CoRR
Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
2016 J jnl
Homing vector automata.
RAIRO Theor. Informatics Appl.
Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro
2016 J jnl
Language Classes Associated with Automata Over Matrix Groups.
CoRR
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2016 — conf
Language classes associated with automata over matrix groups.
NCMA
Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say
2016 J jnl
On Finite-Index Indexed Grammars and Their Restrictions.
CoRR
Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2016 J jnl
On incomplete and synchronizing finite sets.
CoRR
Arturo Carpi, Flavio D'Alessandro
2015 J jnl
On the commutative equivalence of bounded context-free and regular languages: The code case.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila
2015 J jnl
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila
2015 J jnl
On the commutative equivalence of semi-linear sets of N
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila
2014 — conf
Cerny-like problems for finite sets of words.
ICTCS
Arturo Carpi, Flavio D'Alessandro
2014 J jnl
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages.
Int. J. Found. Comput. Sci.
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
2013 J jnl
Independent sets of words and the synchronization problem.
Adv. Appl. Math.
Arturo Carpi, Flavio D'Alessandro
2013 C conf
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.
Developments in Language Theory
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
2013 J jnl
Quantum finite automata and linear context-free languages: a decidable problem
CoRR
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
2012 J jnl
Quasi-polynomials, linear Diophantine equations and semi-linear sets.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2012 J jnl
Regularity of languages defined by formal series with isolated cut point.
RAIRO Theor. Informatics Appl.
Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro
2011 J jnl
Independent sets of words and the synchronization problem
CoRR
Arturo Carpi, Flavio D'Alessandro
2011 — conf
Regularity of Languages Defined by Formal Series with Isolated Cut Point.
NCMA
Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro
2010 J jnl
On Bounded Rational Trace Languages.
Theory Comput. Syst.
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
2010 C conf
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.
Developments in Language Theory
Arturo Carpi, Flavio D'Alessandro
2009 J jnl
On some counting problems for semi-linear sets
CoRR
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2009 J jnl
Strongly transitive automata and the Cerný conjecture.
Acta Informatica
Arturo Carpi, Flavio D'Alessandro
2009 — conf
Synchronizing Automata and Independent Systems of Words.
ICTCS
Arturo Carpi, Flavio D'Alessandro
2009 J jnl
The Parikh counting functions of sparse context-free languages are quasi-polynomials.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2009 B conf
The Synchronization Problem for Locally Strongly Transitive Automata.
MFCS
Arturo Carpi, Flavio D'Alessandro
2008 J jnl
On the Growth of Context-Free Languages.
J. Autom. Lang. Comb.
Flavio D'Alessandro, Stefano Varricchio
2008 J jnl
The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2008 C conf
The Synchronization Problem for Strongly Transitive Automata.
Developments in Language Theory
Arturo Carpi, Flavio D'Alessandro
2008 C conf
Well Quasi-orders in Formal Language Theory.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2007 J jnl
On the separability of sparse context-free languages and of bounded rational relations.
Theor. Comput. Sci.
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
2007 J jnl
Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci.
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
A Non-commutativity Statement for Algebraic Quaternions.
Int. J. Algebra Comput.
Flavio D'Alessandro, Alessandro D'Andrea
2006 J jnl
On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci.
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
2006 C conf
Well Quasi Orders and the Shuffle Closure of Finite Sets.
Developments in Language Theory
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
Well quasi-orders and the shuffle closure of finite sets
CoRR
Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio
2006 J jnl
Well quasi-orders, unavoidable sets, and derivation systems.
RAIRO Theor. Informatics Appl.
Flavio D'Alessandro, Stefano Varricchio
2004 C conf
Avoidable Sets and Well Quasi-Orders.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2004 J jnl
Free Groups of Quaternions.
Int. J. Algebra Comput.
Flavio D'Alessandro
2004 J jnl
Well quasi-orders and context-free grammars.
Theor. Comput. Sci.
Flavio D'Alessandro, Stefano Varricchio
2003 C conf
On Well Quasi-orders on Languages.
Developments in Language Theory
Flavio D'Alessandro, Stefano Varricchio
2003 J jnl
On the Complexity of Simon Automata over the Dyck Language.
J. Autom. Lang. Comb.
Flavio D'Alessandro
2003 J jnl
The finite power property in free groups.
Theor. Comput. Sci.
Flavio D'Alessandro, Jacques Sakarovitch
2002 J jnl
A combinatorial problem on Trapezoidal words.
Theor. Comput. Sci.
Flavio D'Alessandro
1998 J jnl
Commutativity in Free Inverse Monoids.
Theor. Comput. Sci.
Christian Choffrut, Flavio D'Alessandro
1997 J jnl
A Note on the Multiplicative Group of a Division Ring.
Int. J. Algebra Comput.
Flavio D'Alessandro