Average State Complexity of Operations on Unary Automata. - Cyril Nicaud (MFCS, 1999)

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (Developments in Language Theory, 2002)

Lyndon words with a fixed standard right factor. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (SODA, 2004)

The standard factorization of Lyndon words: an average point of view. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (Discret. Math., 2005)

: A Library to Randomly and Exhaustively Generate Automata. - Frédérique Bassino; Julien David; Cyril Nicaud (CIAA, 2007)

Enumeration and random generation of accessible automata. - Frédérique Bassino; Cyril Nicaud (Theor. Comput. Sci., 2007)

The Average State Complexity of the Star of a Finite Set of Words Is Linear. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (Developments in Language Theory, 2008)

Random Generation of Finitely Generated Subgroups of a Free Group. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (Int. J. Algebra Comput., 2008)

On the Average Size of Glushkov's Automata. - Cyril Nicaud (LATA, 2009)

On the Average Complexity of Moore's State Minimization Algorithm. - Frédérique Bassino; Julien David; Cyril Nicaud (STACS, 2009)

Random Generation of Deterministic Tree (Walking) Automata. - Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz (CIAA, 2009)

On Two Distributions of Subgroups of Free Groups. - Frédérique Bassino; Armando Martino; Cyril Nicaud; Enric Ventura; Pascal Weil (ANALCO, 2010)

Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. - Omar AitMous; Frédérique Bassino; Cyril Nicaud (CPM, 2010)

Average Analysis of Glushkov Automata under a BST-Like Model. - Cyril Nicaud; Carine Pivoteau; Benoît Razet (FSTTCS, 2010)

Complexity of Operations on Cofinite Languages. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (LATIN, 2010)

A Challenging Family of Automata for Classical Minimization Algorithms. - Giusi Castiglione; Cyril Nicaud; Marinella Sciortino (CIAA, 2010)

The Average State Complexity of Rational Operations on Finite Languages. - Frédérique Bassino; Laura Giambruno; Cyril Nicaud (Int. J. Found. Comput. Sci., 2010)

Parametric random generation of deterministic tree automata. - Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz (Theor. Comput. Sci., 2010)

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. - Pierre-Cyrille Héam; Cyril Nicaud (ICST, 2011)

An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. - Omar AitMous; Frédérique Bassino; Cyril Nicaud (CPM, 2012)

Distribution of the number of accessible states in a random deterministic automaton. - Arnaud Carayol; Cyril Nicaud (STACS, 2012)

Average Case Analysis of Moore's State Minimization Algorithm. - Frédérique Bassino; Julien David; Cyril Nicaud (Algorithmica, 2012)

An Automaton Approach for Waiting Times in DNA Evolution. - Sarah Behrens; Cyril Nicaud; Pierre Nicodème (J. Comput. Biol., 2012)

Random Generation of Deterministic Acyclic Automata Using the Recursive Method. - Sven De Felice; Cyril Nicaud (CSR, 2013)

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata. - Sven De Felice; Cyril Nicaud (Developments in Language Theory, 2013)

On the genericity of Whitehead minimality. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (CoRR, 2013)

Set systems and families of permutations with small traces. - Otfried Cheong; Xavier Goaoc; Cyril Nicaud (Eur. J. Comb., 2013)

Statistical properties of subgroups of free groups. - Frédérique Bassino; Armando Martino; Cyril Nicaud; Enric Ventura; Pascal Weil (Random Struct. Algorithms, 2013)

On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. - Sven De Felice; Cyril Nicaud (Developments in Language Theory, 2014)

Random Deterministic Automata. - Cyril Nicaud (MFCS (1), 2014)

A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. - Cyril Nicaud (CPM, 2015)

Generic properties of subgroups of free groups and finite presentations. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (AMS-EMS-SPM Joint Meeting, 2016)

Fast Synchronization of Random Automata. - Cyril Nicaud (APPROX-RANDOM, 2016)

Estimating Statistics on Words Using Ambiguous Descriptions. - Cyril Nicaud (CPM, 2016)

Good Predictions Are Worth a Few Comparisons. - Nicolas Auger; Cyril Nicaud; Carine Pivoteau (STACS, 2016)

Analysis of Algorithms for Permutations Biased by Their Number of Records. - Nicolas Auger; Mathilde Bouvel; Cyril Nicaud; Carine Pivoteau (CoRR, 2016)

Average Case Analysis of Brzozowski's Algorithm. - Sven De Felice; Cyril Nicaud (Int. J. Found. Comput. Sci., 2016)

Gapped Pattern Statistics. - Philippe Duchon; Cyril Nicaud; Carine Pivoteau (CPM, 2017)

On the Worst-Case Complexity of TimSort. - Nicolas Auger; Vincent Jugé; Cyril Nicaud; Carine Pivoteau (ESA, 2018)

On the Expected Number of Distinct Gapped Palindromic Factors. - Philippe Duchon; Cyril Nicaud (IWOCA, 2018)

On the Biased Partial Word Collector Problem. - Philippe Duchon; Cyril Nicaud (LATIN, 2018)

Synchronizing Random Almost-Group Automata. - Mikhail V. Berlinkov; Cyril Nicaud (CIAA, 2018)

Uniform Random Expressions Lack Expressivity. - Florent Koechlin; Cyril Nicaud; Pablo Rotondo (MFCS, 2019)

The Černý Conjecture Holds with High Probability. - Cyril Nicaud (J. Autom. Lang. Comb., 2019)

Special issue - Implementation and Application of Automata (CIAA 2017). - Arnaud Carayol; Cyril Nicaud (Theor. Comput. Sci., 2019)

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations. - Florent Koechlin; Cyril Nicaud; Pablo Rotondo (DLT, 2020)

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. - Alin Bostan; Arnaud Carayol; Florent Koechlin; Cyril Nicaud (ICALP, 2020)

Some Families of Trees Arising in Permutation Analysis. - Mathilde Bouvel; Marni Mishna; Cyril Nicaud (Electron. J. Comb., 2020)

Synchronizing Almost-Group Automata. - Mikhail V. Berlinkov; Cyril Nicaud (Int. J. Found. Comput. Sci., 2020)

An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. - Xavier Goaoc; Andreas F. Holmsen; Cyril Nicaud (J. Comput. Geom., 2020)

Statistics of subgroups of the modular group. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (Int. J. Algebra Comput., 2021)

Simplifications of Uniform Expressions Specified by Systems. - Florent Koechlin; Cyril Nicaud; Pablo Rotondo (Int. J. Found. Comput. Sci., 2021)

Random Regular Expression Over Huge Alphabets. - Cyril Nicaud; Pablo Rotondo (Int. J. Found. Comput. Sci., 2021)

A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. - Conrado Martínez; Cyril Nicaud; Pablo Rotondo (COCOON, 2022)

Back-To-Front Online Lyndon Forest Construction. - Golnaz Badkobeh; Maxime Crochemore; Jonas Ellert; Cyril Nicaud (CPM, 2022)

One Drop of Non-Determinism in a Random Deterministic Automaton. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (STACS, 2023)

Theoretical Perspectives on Algorithmic Choices Made in Programming Languages. - Cyril Nicaud (PSC, 2023)

Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (Electron. J. Comb., 2024)

Random DFA With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (CoRR, 2024)

Record-biased permutations and their permuton limit. - Mathilde Bouvel; Cyril Nicaud; Carine Pivoteau (CoRR, 2024)

Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. - Cyril Nicaud; Carine Pivoteau; Stéphane Vialette (CPM, 2025)

Random Deterministic Automata With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (Log. Methods Comput. Sci., 2025)

Mathematical models to analyze Lua hybrid tables. - Conrado Martínez; Cyril Nicaud; Pablo Rotondo (Theor. Comput. Sci., 2025)