9 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.DM2018★ 9 cited
Embedding a -invariant code into a complete one
Jean Néraud, Carla Selmi
Let A be a finite or countable alphabet and let be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet…
cs.FL2017
Ten Conferences WORDS: Open Problems and Conjectures
Jean Néraud
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We…
cs.DM2017
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Jean Néraud, Carla Selmi
Let be a finite or countable alphabet and let be literal (anti)morphism onto (by definition, such a correspondence is determinated by a permutation of the alphabet).…