Jean Néraud

Orcid: 0000-0002-9630-461X

According to our database1, Jean Néraud authored at least 35 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Topologies for error-detecting variable-length codes.
Inf. Comput., December, 2023

Loopless algorithms to generate maximum length gray cycles wrt. <i>k</i>-character substitutions.
Theor. Comput. Sci., October, 2023

Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution.
CoRR, 2023

2022
Variable-length codes independent or closed with respect to edit relations.
Inf. Comput., 2022

When Variable-Length Codes Meet the Field of Error Detection.
Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021
Gray Cycles of Maximum Length Related to k-Character Substitutions.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020
Embedding a <i>θ</i>-invariant code into a complete one.
Theor. Comput. Sci., 2020

Complete Variable-Length Codes: An Excursion into Word Edit Operations.
Proceedings of the Language and Automata Theory and Applications, 2020

2018
Conferences WORDS, years 1997-2017: Open Problems and Conjectures.
Bull. EATCS, 2018

Embedding a θ-invariant code into a complete one.
CoRR, 2018

2017
Ten Conferences WORDS: Open Problems and Conjectures.
CoRR, 2017

Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS.
Bull. EATCS, 2016

2015
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Int. J. Found. Comput. Sci., 2015

On the Contribution of WORDS to the Field of Combinatorics on Words.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2008
Completing circular codes in regular submonoids.
Theor. Comput. Sci., 2008

2006
Completing prefix codes in submonoids.
Theor. Comput. Sci., 2006

On the Completion of Codes in Submonoids with Finite Rank.
Fundam. Informaticae, 2006

2004
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A<sup>*</sup>.
J. Autom. Lang. Comb., 2004

Completing a Code in a Regular Submonoid of the Free Monoid.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids.
Int. J. Algebra Comput., 2003

2002
Locally complete sets and finite decomposable codes.
Theor. Comput. Sci., 2002

WORDS '99 - Preface.
Theor. Comput. Sci., 2002

2001
On codes with a finite deciphering delay: constructing uncompletable words.
Theor. Comput. Sci., 2001

1997
Detecting the Morphic Images of a Word: Improving the General Algorithm.
RAIRO Theor. Informatics Appl., 1997

1995
Algorithms for Detecting Morphic Images of a Word
Inf. Comput., July, 1995

Detecting Morphic Images of a Word on the Rank of a Pattern.
Acta Informatica, 1995

1993
Deciding Whether a Finite Set of Words has Rank at Most Two.
Theor. Comput. Sci., 1993

New Algorithms for Detecting Morphic Images of a Word.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
A String-Matching Interpretation of the Equation xmyn = zp.
Theor. Comput. Sci., 1992

On the Rank of the Subsets of a Free Monoid.
Theor. Comput. Sci., 1992

1991
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991

On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Elementariness of a finite set of words is co-NP-complete.
RAIRO Theor. Informatics Appl., 1990

Unitary Monoid with Two Generators: An Algorithmic Point of View.
Proceedings of the CAAP '90, 1990


  Loading...