Flavio D'Alessandro

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 23

Top Topics

Regular Languages

Related Problems

Monadic Datalog

Finite State Automaton

Top Venues

Theor. Comput. Sci.

RAIRO Theor. Informatics Appl.

Int. J. Found. Comput. Sci.

Publications

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