A characterization of complete finite prefix codes in an arbitrary submonoid of A
Carla Selmi
,
Jean Néraud
Journal of Automata Languages and Combinatorics , 2004, 9, pp.103-110
Article dans une revue
hal-00461875v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Unitary monoid with two generators: an algorithmic point of view
Maxime Crochemore
,
Jean Néraud
CAAP'90, proceedings of the 15th Colloquium on Trees in Algebra and Programming (Copenhagen, 1990) , 1990, France. pp.117-131
Communication dans un congrès
hal-00619992v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
Jean Néraud
Bulletin of Association for Theoretical Computer Science (BEATCS) , In press, Bulletin of Association for Theoretical Computer Science (BEATCS) Number 125-June 2018, 125, pp.119-148
Article dans une revue
hal-01788762v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Variable-Length Codes Independent or Closed with respect to Edit Relations
Jean Néraud
2021
Pré-publication, Document de travail
hal-03208074v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Gray Cycles of Maximum Length Related to k-Character Substitutions
Jean Néraud
2021
Pré-publication, Document de travail
hal-03328751v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution
Jean Néraud
2023
Pré-publication, Document de travail
hal-04194507v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Jean Néraud
,
Carla Selmi
Springer, LNCS. , 2017, pp.214-227
Article dans une revue
hal-02117030v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Jean Néraud
,
Carla Selmi
WORDS 2017 , Srečko Brlek ; Christophe Reutenauer, Sep 2017, Montréal, QC, France
Communication dans un congrès
hal-01519557v4
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On the Contribution of WORDS to the Field of Combinatorics on Words
Jean Néraud
Combinatorics on Words , pp.27-34, 2015
Chapitre d'ouvrage
hal-02123623v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Complete Variable-Length Codes: An Excursion into Word Edit Operations
Jean Néraud
LATA 2020 , Mar 2020, Milan, Italy
Communication dans un congrès
hal-02389403v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Embedding a θ-invariant code into a complete one
Jean Néraud
,
Carla Selmi
Article dans une revue
hal-01683320v3
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On codes with a finite deciphering delay: constructing uncompletable words
Carla Selmi
,
Jean Néraud
Theoretical Computer Science , 2001, 255, pp.151-162
Article dans une revue
hal-00460320v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS
Jean Néraud
EATCS Bulletin , 2016, 118, pp.145-155
Article dans une revue
hal-02123574v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Locally complete sets and finite decomposable codes
Carla Selmi
,
Jean Néraud
Theoretical Computer Science , 2002, 273, pp.185-196
Article dans une revue
hal-00460321v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Topologies for Error-Detecting Variable-Length Codes
Jean Néraud
2023
Pré-publication, Document de travail
hal-04195106v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
Jean Néraud
Bulletin of Association for Theoretical Computer Science (BEATCS) , 2018
Article dans une revue
hal-02355621v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
When Variable-Length Codes Meet the Field of Error Detection
Jean Néraud
2022
Pré-publication, Document de travail
hal-03764465v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Free Monoid Theory: Maximality and Completeness in Arbitrary Submonoid
Carla Selmi
,
Jean Néraud
International Journal of Algebra and Computation , 2003, 13 (5), pp.507-516
Article dans une revue
hal-00460322v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
Laura Giambruno
,
Sabrina Mantaci
,
Jean Néraud
,
Carla Selmi
Communication dans un congrès
hal-00913504v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
A string-matching interpretation of the equation $x^{m}y^{n}=z^{p}$
Jean Néraud
,
Maxime Crochemore
Theoretical Computer Science , 1992, 92 (1), pp.145-164
Article dans une revue
hal-00619677v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More