HomeEPiC SeriesKalpa PublicationsPreprintsFor AuthorsFor Editors

Author:Jean Néraud

Publications
Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms
Jean Néraud and Carla Selmi
EasyChair Preprint no. 2198
Complete Variable-Length Codes: An Excursion into Word Edit Operations
Jean Néraud
EasyChair Preprint no. 2195

Keyphrases

antimorphism, bifix, binary relation, character deletion, circular, Circular code, closed, closed code, closed set, code2, complete2, 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 monoid2, independent code, insertion, invariant code, invariant set, k character deletion, k closed code, literal, maximal2, maximal code2, 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, smallest invariant free submonoid, string, substitution, subword, Synchronizing delay, thin code, thin invariant code, uniform bernoulli distribution, uniformly synchronized code, Variable Length, variable-length code2, word2, word modulo.

Copyright © 2012-2021 easychair.org. All rights reserved.