Jean Néraud

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