 | 2009 |
|---|
| 12 |       | Pierre-Cyrille Héam,
Cyril Nicaud,
Sylvain Schmitz:
Random Generation of Deterministic Tree (Walking) Automata.
CIAA 2009: 115-124 |
| 11 | | Cyril Nicaud:
On the Average Size of Glushkov's Automata.
LATA 2009: 626-637 |
| 10 | | Frédérique Bassino,
Julien David,
Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm.
STACS 2009: 123-134 |
| 9 | | Frédérique Bassino,
Julien David,
Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm
CoRR abs/0902.1048: (2009) |
| 2008 |
|---|
| 8 | | Frédérique Bassino,
Laura Giambruno,
Cyril Nicaud:
The Average State Complexity of the Star of a Finite Set of Words Is Linear.
Developments in Language Theory 2008: 134-145 |
| 7 | | Frédérique Bassino,
Cyril Nicaud,
Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group.
IJAC 18(2): 375-405 (2008) |
| 2007 |
|---|
| 6 | | Frédérique Bassino,
Julien David,
Cyril Nicaud:
: A Library to Randomly and Exhaustively Generate Automata.
CIAA 2007: 303-305 |
| 5 | | Frédérique Bassino,
Cyril Nicaud:
Enumeration and random generation of accessible automata.
Theor. Comput. Sci. 381(1-3): 86-104 (2007) |
| 2005 |
|---|
| 4 | | Frédérique Bassino,
Julien Clément,
Cyril Nicaud:
The standard factorization of Lyndon words: an average point of view.
Discrete Mathematics 290(1): 1-25 (2005) |
| 2004 |
|---|
| 3 | | Frédérique Bassino,
Julien Clément,
Cyril Nicaud:
Lyndon words with a fixed standard right factor.
SODA 2004: 653-654 |
| 2002 |
|---|
| 2 | | Frédérique Bassino,
Julien Clément,
Cyril Nicaud:
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.
Developments in Language Theory 2002: 307-318 |
| 1999 |
|---|
| 1 | | Cyril Nicaud:
Average State Complexity of Operations on Unary Automata.
MFCS 1999: 231-240 |
