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.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).…
cs.GT2010
Strategical languages of infinite words
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existence…