Star-Height of an N-Rational Series. - Frédérique Bassino (STACS, 1996)

Enumerative Sequences of Leaves in Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (ICALP, 1997)

Nonnegative Companion Matrices and Star-Height of N-Rational Series. - Frédérique Bassino (Theor. Comput. Sci., 1997)

Super-State Automata and Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (LATIN, 1998)

Enumerative Sequences of Leaves and Nodes in Rational Trees. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (Theor. Comput. Sci., 1999)

A Finite State Version of the Kraft–McMillan Theorem. - Frédérique Bassino; Marie-Pierre Béal; Dominique Perrin (SIAM J. Comput., 2000)

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)

Beta-Expansions for Cubic Pisot Numbers. - Frédérique Bassino (LATIN, 2002)

Automata for Arithmetic Meyer Sets. - Shigeki Akiyama; Frédérique Bassino; Christiane Frougny (LATIN, 2004)

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

Automates, énumération et algorithmes. (Automata, enumeration and algorithms). - Frédérique Bassino (2005)

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

Arithmetic Meyer sets and finite automata. - Shigeki Akiyama; Frédérique Bassino; Christiane Frougny (Inf. Comput., 2005)

Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. - Frédérique Bassino; Julien Clément 001; Gadiel Seroussi; Alfredo Viola (DCC, 2006)

: 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)

Constructions for Clumps Statistics - Frédérique Bassino; Julien Clément 001; Julien Fayolle; Pierre Nicodème (CoRR, 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 Complexity of Moore's State Minimization Algorithm. - Frédérique Bassino; Julien David; Cyril Nicaud (STACS, 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)

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

Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (CoRR, 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)

Enumeration of Pin-Permutations. - Frédérique Bassino; Mathilde Bouvel; Dominique Rossin (Electron. J. Comb., 2011)

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

Asymptotic enumeration of Minimal Automata. - Frédérique Bassino; Julien David; Andrea Sportiello (STACS, 2012)

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

Counting occurrences for a finite set of words: Combinatorial methods. - Frédérique Bassino; Julien Clément 001; Pierre Nicodème (ACM Trans. Algorithms, 2012)

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

Linear-time generation of specifiable combinatorial structures: general theory and first examples. - Frédérique Bassino; Andrea Sportiello (CoRR, 2013)

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

Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables. - Frédérique Bassino; Julien Clément 001; Gadiel Seroussi; Alfredo Viola (IEEE Trans. Inf. Theory, 2013)

Linear-time generation of inhomogeneous random directed walks. - Frédérique Bassino; Andrea Sportiello (ANALCO, 2015)

An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Dominique Rossin (Adv. Appl. Math., 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)

An algorithm computing combinatorial specifications of permutation classes. - Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot; Carine Pivoteau; Dominique Rossin (Discret. Appl. Math., 2017)

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. - Frédérique Bassino; Flavia Bonomo; Lionel Pournin; Mario Valencia-Pabon; Juan C. Vera 001 (Electron. Notes Discret. Math., 2017)

The complexity of the Multiple Pattern Matching Problem for random strings. - Frédérique Bassino; Tsinjo Rakotoarimalala; Andrea Sportiello (ANALCO, 2018)

Linear-time exact sampling of sum-constrained random variables. - Frédérique Bassino; Andrea Sportiello (GASCom, 2018)

The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. - Frédérique Bassino; Tsinjo Rakotoarimalala; Andrea Sportiello (AofA, 2020)

Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. - Frédérique Bassino; Flavia Bonomo-Braberman; Lionel Pournin; Mario Valencia-Pabon (Discret. Appl. Math., 2020)

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

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. - Frédérique Bassino; Mathilde Bouvel; Michael Drmota; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Comb. Theory, 2022)

Random cographs: Brownian graphon limit and asymptotic degree distribution. - Frédérique Bassino; Mathilde Bouvel; Valentin Féray; Lucas Gerin; Mickaël Maazoun; Adeline Pierrot (Random Struct. Algorithms, 2022)

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)