Jean Néraud

most citedEmbedding a

θ

-invariant code into a complete one

9 citations · 9 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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.DM2017

Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Jean Néraud, Carla Selmi

Let $A$ be a finite or countable alphabet and let $θ$ be literal (anti)morphism onto $A^{*}$ (by definition, such a correspondence is determinated by a permutation of the alphabet).…

Embedding a θ-invariant code into a complete one

Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Embedding a $θ$ -invariant code into a complete one