8 citations · 20 across the 10 of their papers we have counts for
10 papers
The decidability of the genus of regular languages and directed emulators
Guillaume Bonfante, Florian Deloup
The article continues our study of the genus of a regular language , defined as the minimal genus among all genera of all finite deterministic automata recognizing . Here we…
Decidability of regular language genus computation
Guillaume Bonfante, Florian Deloup
The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular la…
The genus of regular languages
Guillaume Bonfante, Florian Deloup
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus ari…
On Reciprocity
Florian Deloup, Vladimir Turaev
We prove a reciprocity formula between Gauss sums that is used in the computation of certain quantum invariants of 3-manifolds. Our proof uses the discriminant construction applied…
Palindromic Braids
F. Deloup, D. Garber, S. Kaplan +1
The braid group , endowed with Artin's presentation, admits an antiautomorphism , such that is defined by reading braids in reverse orde…
Palindromes and orderings in Artin groups
Florian Deloup
The braid group , endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism , , d…