Jean Néraud

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 21

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

Jean Néraud
-character substitutions. Theor. Comput. Sci. 977 (2023)
Jean Néraud
Topologies for Error-Detecting Variable-Length Codes. CoRR (2023)
Jean Néraud
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution. CoRR (2023)
Jean Néraud
Topologies for error-detecting variable-length codes. Inf. Comput. 295 (Part B) (2023)
Jean Néraud
When Variable-Length Codes Meet the Field of Error Detection. CoRR (2022)
Jean Néraud
Variable-length codes independent or closed with respect to edit relations. Inf. Comput. 288 (2022)
Jean Néraud
When Variable-Length Codes Meet the Field of Error Detection. CAI (2022)
Jean Néraud
Gray Cycles of Maximum Length Related to k-Character Substitutions. CoRR (2021)
Jean Néraud
Variable-Length Codes Independent or Closed with respect to Edit Relations. CoRR (2021)
Jean Néraud
Gray Cycles of Maximum Length Related to k-Character Substitutions. DCFS (2021)
Jean Néraud, Carla Selmi
-invariant code into a complete one. Theor. Comput. Sci. 806 (2020)
Jean Néraud
Complete Variable-Length Codes: An Excursion into Word Edit Operations. LATA (2020)
Jean Néraud
Complete Variable-Length Codes: An Excursion into Word Edit Operations. CoRR (2019)
Jean Néraud
Conferences WORDS, years 1997-2017: Open Problems and Conjectures. Bull. EATCS 125 (2018)
Jean Néraud, Carla Selmi
Embedding a θ-invariant code into a complete one. CoRR (2018)
Jean Néraud, Carla Selmi
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. CoRR (2017)
Jean Néraud
Ten Conferences WORDS: Open Problems and Conjectures. CoRR (2017)
Jean Néraud, Carla Selmi
Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms. WORDS (2017)
Jean Néraud
Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS. Bull. EATCS 118 (2016)
Jean Néraud
On the Contribution of WORDS to the Field of Combinatorics on Words. WORDS (2015)
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Int. J. Found. Comput. Sci. 26 (6) (2015)
Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. Developments in Language Theory (2012)
Jean Néraud
Completing circular codes in regular submonoids. Theor. Comput. Sci. 391 (1-2) (2008)
Jean Néraud
Completing prefix codes in submonoids. Theor. Comput. Sci. 356 (1-2) (2006)
Jean Néraud
On the Completion of Codes in Submonoids with Finite Rank. Fundam. Informaticae 74 (4) (2006)
Jean Néraud, Carla Selmi
. J. Autom. Lang. Comb. 9 (1) (2004)
Jean Néraud
Completing a Code in a Regular Submonoid of the Free Monoid. MCU (2004)
Jean Néraud, Carla Selmi
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids. Int. J. Algebra Comput. 13 (5) (2003)
Jean Néraud
WORDS '99 - Preface. Theor. Comput. Sci. 273 (1-2) (2002)
Jean Néraud, Carla Selmi
Locally complete sets and finite decomposable codes. Theor. Comput. Sci. 273 (1-2) (2002)
Jean Néraud, Carla Selmi
On codes with a finite deciphering delay: constructing uncompletable words. Theor. Comput. Sci. 255 (1-2) (2001)
Jean Néraud
Detecting the Morphic Images of a Word: Improving the General Algorithm. RAIRO Theor. Informatics Appl. 31 (1) (1997)
Jean Néraud
Algorithms for Detecting Morphic Images of a Word Inf. Comput. 120 (1) (1995)
Jean Néraud
Detecting Morphic Images of a Word on the Rank of a Pattern. Acta Informatica 32 (5) (1995)
Jean Néraud
New Algorithms for Detecting Morphic Images of a Word. MFCS (1993)
Jean Néraud
Deciding Whether a Finite Set of Words has Rank at Most Two. Theor. Comput. Sci. 112 (2) (1993)
Jean Néraud, Maxime Crochemore
A String-Matching Interpretation of the Equation xmyn = zp. Theor. Comput. Sci. 92 (1) (1992)
Jean Néraud
On the Rank of the Subsets of a Free Monoid. Theor. Comput. Sci. 99 (2) (1992)
Jean Néraud
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). FCT (1991)
Jean Néraud
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm. IWWERT (1991)
Maxime Crochemore, Jean Néraud
Unitary Monoid with Two Generators: An Algorithmic Point of View. CAAP (1990)
Jean Néraud
Elementariness of a finite set of words is co-NP-complete. RAIRO Theor. Informatics Appl. 24 (1990)