dblp.uni-trier.dewww.uni-trier.de

Cyril Nicaud

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
11EECyril Nicaud: On the Average Size of Glushkov's Automata. LATA 2009: 626-637
10EEFrédérique Bassino, Julien David, Cyril Nicaud: On the Average Complexity of Moore's State Minimization Algorithm. STACS 2009: 123-134
9EEFrédérique Bassino, Julien David, Cyril Nicaud: On the Average Complexity of Moore's State Minimization Algorithm CoRR abs/0902.1048: (2009)
2008
8EEFré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
7EEFrédérique Bassino, Cyril Nicaud, Pascal Weil: Random Generation of Finitely Generated Subgroups of a Free Group. IJAC 18(2): 375-405 (2008)
2007
6EEFrédérique Bassino, Julien David, Cyril Nicaud: : A Library to Randomly and Exhaustively Generate Automata. CIAA 2007: 303-305
5EEFrédérique Bassino, Cyril Nicaud: Enumeration and random generation of accessible automata. Theor. Comput. Sci. 381(1-3): 86-104 (2007)
2005
4EEFré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
3EEFrédérique Bassino, Julien Clément, Cyril Nicaud: Lyndon words with a fixed standard right factor. SODA 2004: 653-654
2002
2EEFré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

Coauthor Index

1Frédérique Bassino [2] [3] [4] [5] [6] [7] [8] [9] [10]
2Julien Clément [2] [3] [4]
3Julien David [6] [9] [10]
4Laura Giambruno [8]
5Pascal Weil [7]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)