# Author:Jean Néraud

Publications |
---|

EasyChair Preprint no. 2198 |

EasyChair Preprint no. 2195 |

### Keyphrases

antimorphism, bifix, binary relation, character deletion, circular, Circular code, closed, closed code, closed set, code^{2}, complete^{2}, complete code, complete regular, complete regular invariant code, complete variable length code, countable alphabet, deciphering delay, defect, deletion, edit operation, embedding, equation, finite alphabet, Finite deciphering delay, free monoid^{2}, independent code, insertion, invariant code, invariant set, k character deletion, k closed code, literal, maximal^{2}, maximal code^{2}, 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, smallest invariant free submonoid, string, substitution, subword, Synchronizing delay, thin code, thin invariant code, uniform bernoulli distribution, uniformly synchronized code, Variable Length, variable-length code^{2}, word^{2}, word modulo.