Author:Jean Néraud

Publications
EasyChair Preprint no. 7047
EasyChair Preprint no. 2198
EasyChair Preprint no. 2195

Keyphrases

antimorphism, ary reflected gray code, bifix, binary, binary alphabet, binary relation, character, character deletion, circular, Circular code, closed2, closed code, closed set, code2, combinatorial, Combinatorial Gray code, complete2, 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 alphabet2, Finite deciphering delay, free monoid2, 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, maximal2, maximal code2, maximum length, morphism, non complete2, 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 code2, regular independent code, regular invariant code, relation, smallest invariant free submonoid, string, substitution2, subword, Synchronizing delay, thin code, thin invariant code, uniform bernoulli distribution, uniformly synchronized code, Variable Length, variable-length code3, word3, word binary relation, word modulo.