Följ
Flavio D'Alessandro
Flavio D'Alessandro
Verifierad e-postadress på mat.uniroma1.it
Titel
Citeras av
Citeras av
År
Strongly transitive automata and the Cerný conjecture
A Carpi, F D'alessandro
Acta Informatica 46 (8), 591, 2009
292009
On the structure of the counting function of sparse context-free languages
F D’Alessandro, B Intrigila, S Varricchio
Theoretical computer science 356 (1-2), 104-117, 2006
262006
The synchronization problem for locally strongly transitive automata
A Carpi, F D’Alessandro
International Symposium on Mathematical Foundations of Computer Science, 211-222, 2009
212009
The synchronization problem for strongly transitive automata
A Carpi, F D’Alessandro
International Conference on Developments in Language Theory, 240-251, 2008
192008
On the hybrid Černý-road coloring problem and Hamiltonian paths
A Carpi, F D’Alessandro
International Conference on Developments in Language Theory, 124-135, 2010
182010
A combinatorial property for semigroups of matrices
F d’Alessandro, E Pasku
Semigroup Forum 67 (1), 22-30, 2003
172003
Earthquake-induced landslide scenarios for seismic microzonation: application to the Accumoli area (Rieti, Italy)
S Martino, S Battaglia, F D’alessandro, M Della Seta, C Esposito, ...
Bulletin of Earthquake Engineering 18 (12), 5655-5673, 2020
16*2020
The Parikh counting functions of sparse context-free languages are quasi-polynomials
F D’Alessandro, B Intrigila, S Varricchio
Theoretical computer science 410 (47-49), 5158-5181, 2009
152009
A combinatorial problem on trapezoidal words
F D'Alessandro
Theoretical computer science 273 (1-2), 11-33, 2002
132002
On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
F D'Alessandro, B Intrigila
Theoretical Computer Science 572, 1-24, 2015
102015
On the commutative equivalence of bounded context-free and regular languages: the code case
F D'Alessandro, B Intrigila
Theoretical Computer Science 562, 304-319, 2015
102015
On the commutative equivalence of semi-linear sets of Nk
F D'Alessandro, B Intrigila
Theoretical Computer Science 562, 476-495, 2015
102015
Commutativity in free inverse monoids
C Choffrut, F D'Alessandro
Theoretical computer science 204 (1-2), 35-54, 1998
101998
On finite-index indexed grammars and their restrictions
F D'Alessandro, OH Ibarra, I McQuillan
Information and Computation 279, 104613, 2021
92021
On well quasi-orders on languages
F D’Alessandro, S Varricchio
International Conference on Developments in Language Theory, 230-241, 2003
92003
Teoria degli automi finiti
A De Luca, F D'Alessandro
Springer Science & Business Media, 2013
82013
Well quasi-orders and context-free grammars
F D'Alessandro, S Varricchio
Theoretical Computer Science 327 (3), 255-268, 2004
82004
On incomplete and synchronizing finite sets
A Carpi, F D'Alessandro
Theoretical Computer Science 664, 67-77, 2017
72017
Quasi-polynomials, linear Diophantine equations and semi-linear sets
F D’alessandro, B Intrigila, S Varricchio
Theoretical Computer Science 416, 1-16, 2012
62012
On the commutative equivalence of context-free languages
A Carpi, F D’Alessandro
International Conference on Developments in Language Theory, 169-181, 2018
52018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20