# Author:Jean Néraud

Publications |
---|

EasyChair Preprint 7047 |

EasyChair Preprint 2198 |

EasyChair Preprint 2195 |

### Keyphrases

antimorphism, ary reflected gray code, bifix, binary, binary alphabet, binary relation, character, character deletion, circular, Circular code, closed^{2}, closed code, closed set, code^{2}, combinatorial, Combinatorial Gray code, complete^{2}, complete code, complete regular, complete regular invariant code, complete variable length code, complexity cycle, countable alphabet, deciphering delay, defect, deletion, dependence, edit operation, embedding, equation, finite alphabet^{2}, Finite deciphering delay, free monoid^{2}, gray, Gray code, gray cycle, independent code, induction stage, insertion, invariant code, invariant set, k character deletion, k character substitution, k closed code, k gray cycle, k satisfy condition, literal, maximal^{2}, maximal code^{2}, maximum length, morphism, non complete^{2}, non complete code, non complete invariant code, non complete k closed code, non trivial equation, overlapping free word, positive bernoulli distribution, prefix, prefix code, regular, regular code^{2}, regular independent code, regular invariant code, relation, smallest invariant free submonoid, string, substitution^{2}, subword, Synchronizing delay, thin code, thin invariant code, uniform bernoulli distribution, uniformly synchronized code, Variable Length, variable-length code^{3}, word^{3}, word binary relation, word modulo.