Unitary Monoid with Two Generators: An Algorithmic Point of View. - Maxime Crochemore; Jean Néraud (CAAP, 1990)

Elementariness of a finite set of words is co-NP-complete. - Jean Néraud (RAIRO Theor. Informatics Appl., 1990)

On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). - Jean Néraud (FCT, 1991)

On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm. - Jean Néraud (IWWERT, 1991)

On the Rank of the Subsets of a Free Monoid. - Jean Néraud (Theor. Comput. Sci., 1992)

A String-Matching Interpretation of the Equation xmyn = zp. - Jean Néraud; Maxime Crochemore (Theor. Comput. Sci., 1992)

New Algorithms for Detecting Morphic Images of a Word. - Jean Néraud (MFCS, 1993)

Deciding Whether a Finite Set of Words has Rank at Most Two. - Jean Néraud (Theor. Comput. Sci., 1993)

Detecting Morphic Images of a Word on the Rank of a Pattern. - Jean Néraud (Acta Informatica, 1995)

Algorithms for Detecting Morphic Images of a Word - Jean Néraud (Inf. Comput., 1995)

Detecting the Morphic Images of a Word: Improving the General Algorithm. - Jean Néraud (RAIRO Theor. Informatics Appl., 1997)

On codes with a finite deciphering delay: constructing uncompletable words. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2001)

WORDS '99 - Preface. - Jean Néraud (Theor. Comput. Sci., 2002)

Locally complete sets and finite decomposable codes. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2002)

Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. - Jean Néraud; Carla Selmi (Int. J. Algebra Comput., 2003)

Completing a Code in a Regular Submonoid of the Free Monoid. - Jean Néraud (MCU, 2004)

A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. - Jean Néraud; Carla Selmi (J. Autom. Lang. Comb., 2004)

On the Completion of Codes in Submonoids with Finite Rank. - Jean Néraud (Fundam. Informaticae, 2006)

Completing prefix codes in submonoids. - Jean Néraud (Theor. Comput. Sci., 2006)

Completing circular codes in regular submonoids. - Jean Néraud (Theor. Comput. Sci., 2008)

On the Contribution of WORDS to the Field of Combinatorics on Words. - Jean Néraud (WORDS, 2015)

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. - Laura Giambruno; Sabrina Mantaci; Jean Néraud; Carla Selmi (Int. J. Found. Comput. Sci., 2015)

Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS. - Jean Néraud (Bull. EATCS, 2016)

Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. - Jean Néraud; Carla Selmi (WORDS, 2017)

Ten Conferences WORDS: Open Problems and Conjectures. - Jean Néraud (CoRR, 2017)

Embedding a θ-invariant code into a complete one. - Jean Néraud; Carla Selmi (CoRR, 2018)

Conferences WORDS, years 1997-2017: Open Problems and Conjectures. - Jean Néraud (Bull. EATCS, 2018)

Complete Variable-Length Codes: An Excursion into Word Edit Operations. - Jean Néraud (LATA, 2020)

Embedding a θ-invariant code into a complete one. - Jean Néraud; Carla Selmi (Theor. Comput. Sci., 2020)

Gray Cycles of Maximum Length Related to k-Character Substitutions. - Jean Néraud (DCFS, 2021)

When Variable-Length Codes Meet the Field of Error Detection. - Jean Néraud (CAI, 2022)

Variable-length codes independent or closed with respect to edit relations. - Jean Néraud (Inf. Comput., 2022)

Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution. - Jean Néraud (CoRR, 2023)

Loopless algorithms to generate maximum length gray cycles wrt. k-character substitutions. - Jean Néraud (Theor. Comput. Sci., 2023)

Topologies for error-detecting variable-length codes. - Jean Néraud (Inf. Comput., 2023)