Jean Néraud

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Topologies for error-detecting variable-length codes	2024-02-02	Paper
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions	2023-10-17	Paper
When variable-length codes meet the field of error detection	2023-07-26	Paper
Gray cycles of maximum length related to \(k\)-character substitutions	2022-11-09	Paper
Variable-length codes independent or closed with respect to edit relations	2022-10-13	Paper
Complete variable-length codes: an excursion into word edit operations	2020-07-27	Paper
Embedding a \(\theta \)-invariant code into a complete one	2020-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q5203929	2019-12-09	Paper
Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms	2017-11-15	Paper
Ten Conferences WORDS: Open Problems and Conjectures	2017-05-11	Paper
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay	2015-12-11	Paper
On the Contribution of WORDS to the Field of Combinatorics on Words	2015-11-04	Paper
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay	2012-11-02	Paper
Completing circular codes in regular submonoids	2008-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q3416096	2007-01-19	Paper
Completing prefix codes in submonoids.	2006-05-18	Paper
Machines, Computations, and Universality	2005-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4654644	2005-03-08	Paper
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS	2004-05-27	Paper
Locally complete sets and finite decomposable codes	2002-07-15	Paper
On codes with a finite deciphering delay: Constructing uncompletable words	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4266527	1999-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q4266532	1999-10-03	Paper
Detecting the morphic images of a word : improving the general algorithm	1997-12-14	Paper
Algorithms for detecting morphic images of a word	1996-04-16	Paper
Detecting morphic images of a word: On the rank of a pattern	1995-11-09	Paper
Equations in words: An algorithmic contribution	1994-06-15	Paper
Deciding whether a finite set of words has rank at most two	1993-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q4027623	1993-02-21	Paper
On the rank of the subsets of a free monoid	1992-09-27	Paper
A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)	1992-09-26	Paper
On the deficit of a finite set of words	1990-01-01	Paper
Elementariness of a finite set of words is co-NP-complete	1990-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jean Néraud