Uniform Random Expressions Lack Expressivity. - Florent Koechlin; Cyril Nicaud; Pablo Rotondo (MFCS, 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)

Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection. - Florent Koechlin; Pablo Rotondo (CSR, 2021)

Absorbing Patterns in BST-Like Expression-Trees. - Florent Koechlin; Pablo Rotondo (STACS, 2021)

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

Systèmes de fonctions holonomes: application à la théorie des automates. (Systems of holonomic functions: application in automata theory). - Florent Koechlin (2021)

New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages. - Florent Koechlin (FSTTCS, 2022)

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

A Canonical Tree Decomposition for Chirotopes. - Mathilde Bouvel; Valentin Féray; Xavier Goaoc; Florent Koechlin (SoCG, 2024)

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

A canonical tree decomposition for order types, and some applications. - Mathilde Bouvel; Valentin Féray; Xavier Goaoc; Florent Koechlin (CoRR, 2024)

The effects of semantic simplifications on random BST-like expression-trees. - Florent Koechlin; Pablo Rotondo (Discret. Math., 2024)

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