Travelled to:1 × Canada
1 × France
1 × Hungary
1 × Japan
1 × New Zealand
1 × USA
Collaborated with:S.Varricchio A.Carpi A.Bertoni C.Choffrut G.Richomme Ö.Salehi A.C.C.Say
Talks about:problem (4) languag (4) quasi (4) order (4) well (4) automata (3) quantum (2) context (2) finit (2) decid (2)
Person: Flavio D'Alessandro
DBLP: D'Alessandro:Flavio
Contributed to:
2013201420102008200620042003
2017Wrote 9 papers:
- DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
- DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum
- On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
- DLT-2010-CarpiD #hybrid #on the #problem
- On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.
- DLT-2008-CarpiD #automaton #problem #transitive
- The Synchronization Problem for Strongly Transitive Automata (AC, FD), pp. 240–251.
- DLT-2008-DAlessandroV #formal method
- Well Quasi-orders in Formal Language Theory (FD, SV), pp. 84–95.
- DLT-2006-DAlessandroRV #finite #order #set
- Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
- DLT-2004-DAlessandroV #set
- Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.
- DLT-2003-DAlessandroV #on the
- On Well Quasi-orders on Languages (FD, SV), pp. 230–241.
- AFL-2017-SalehiDS #memory management #monad
- Generalized Results on Monoids as Memory (ÖS, FD, ACCS), pp. 234–247.