Florent Koechlin

According to our database, Florent Koechlin authored at least 13 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The effects of semantic simplifications on random BST-like expression-trees.

Florent Koechlin, Pablo Rotondo

Discret. Math., 2024

A canonical tree decomposition for order types, and some applications.

Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin

CoRR, 2024

Random DFA With One Added Transition.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

CoRR, 2024

A Canonical Tree Decomposition for Chirotopes.

Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

One Drop of Non-Determinism in a Random Deterministic Automaton.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages.

Florent Koechlin

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

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

Florent Koechlin

PhD thesis, 2021

Simplifications of Uniform Expressions Specified by Systems.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Int. J. Found. Comput. Sci., 2021

Absorbing Patterns in BST-Like Expression-Trees.

Florent Koechlin, Pablo Rotondo

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection.

Florent Koechlin, Pablo Rotondo

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.

Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

Uniform Random Expressions Lack Expressivity.

Florent Koechlin, Cyril Nicaud, Pablo Rotondo

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019