| 2008 |
|---|
| 16 | EE | Arturo Carpi,
Flavio D'Alessandro:
The Synchronization Problem for Strongly Transitive Automata.
Developments in Language Theory 2008: 240-251 |
| 15 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Well Quasi-orders in Formal Language Theory.
Developments in Language Theory 2008: 84-95 |
| 14 | EE | Flavio D'Alessandro,
Benedetto Intrigila,
Stefano Varricchio:
The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR abs/0807.0718: (2008) |
| 2007 |
|---|
| 13 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well quasi-orders generated by a word-shuffle rewriting.
Theor. Comput. Sci. 377(1-3): 73-92 (2007) |
| 12 | EE | 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): 274-279 (2007) |
| 2006 |
|---|
| 11 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well Quasi Orders and the Shuffle Closure of Finite Sets.
Developments in Language Theory 2006: 260-269 |
| 10 | EE | Flavio D'Alessandro,
Gwénaël Richomme,
Stefano Varricchio:
Well quasi-orders and the shuffle closure of finite sets
CoRR abs/cs/0607082: (2006) |
| 9 | EE | Flavio D'Alessandro,
Alessandro D'Andrea:
A Non-commutativity Statement for Algebraic Quaternions.
IJAC 16(3): 583-602 (2006) |
| 8 | EE | 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): 104-117 (2006) |
| 2004 |
|---|
| 7 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Avoidable Sets and Well Quasi-Orders.
Developments in Language Theory 2004: 139-150 |
| 6 | EE | Flavio D'Alessandro:
Free Groups of Quaternions.
IJAC 14(1): 69-86 (2004) |
| 5 | EE | Flavio D'Alessandro,
Stefano Varricchio:
Well quasi-orders and context-free grammars.
Theor. Comput. Sci. 327(3): 255-268 (2004) |
| 2003 |
|---|
| 4 | EE | Flavio D'Alessandro,
Stefano Varricchio:
On Well Quasi-orders on Languages.
Developments in Language Theory 2003: 230-241 |
| 3 | | Flavio D'Alessandro:
On the Complexity of Simon Automata over the Dyck Language.
Journal of Automata, Languages and Combinatorics 8(3): 465-476 (2003) |
| 2002 |
|---|
| 2 | EE | Flavio D'Alessandro:
A combinatorial problem on Trapezoidal words.
Theor. Comput. Sci. 273(1-2): 11-33 (2002) |
| 1998 |
|---|
| 1 | EE | Christian Choffrut,
Flavio D'Alessandro:
Commutativity in Free Inverse Monoids.
Theor. Comput. Sci. 204(1-2): 35-54 (1998) |
