×
Author ID: neraud.jean Recent zbMATH articles by "Néraud, Jean"
Published as: Néraud, Jean; Neraud, Jean; Neraud, J.; Néraud, J.
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

23 Publications have been cited 64 times in 31 Documents Cited by Year
Elementariness of a finite set of words is co-NP-complete. Zbl 0704.68065
Neraud, Jean
10
1990
Completing circular codes in regular submonoids. Zbl 1135.68029
Néraud, Jean
5
2008
Variable-length codes independent or closed with respect to edit relations. Zbl 07601277
Néraud, Jean
5
2022
Free monoid theory: Maximality and completeness in arbitrary submonoids. Zbl 1064.68076
Néraud, Jean; Selmi, Carla
4
2003
On the completion of codes in submonoids with finite rank. Zbl 1106.68062
Néraud, Jean
4
2006
Locally complete sets and finite decomposable codes. Zbl 0996.68055
Néraud, Jean; Selmi, Carla
3
2002
Equations in words: An algorithmic contribution. Zbl 0803.68097
Néraud, Jean
3
1994
Completing prefix codes in submonoids. Zbl 1093.94020
Néraud, Jean
3
2006
A characterization of complete finite prefix codes in an arbitrary submonoid of \(A^*\). Zbl 1102.68071
Néraud, Jean; Selmi, Carla
3
2004
On the deficit of a finite set of words. Zbl 0679.20049
Néraud, Jean
3
1990
Embedding a \(\theta \)-invariant code into a complete one. Zbl 1436.68183
Néraud, Jean; Selmi, Carla
3
2020
On the rank of the subsets of a free monoid. Zbl 0779.20037
Néraud, Jean
2
1992
On codes with a finite deciphering delay: Constructing uncompletable words. Zbl 0974.68053
Néraud, J.; Selmi, C.
2
2001
Unitary monoid with two generators: An algorithmic point of view. Zbl 0758.68053
Crochemore, M.; Neraud, J.
2
1990
Deciding whether a finite set of words has rank at most two. Zbl 0798.68088
Néraud, Jean
2
1993
Completing a code in a regular submonoid of the free monoid (extended abstract). Zbl 1102.68499
Néraud, Jean
2
2005
When variable-length codes meet the field of error detection. Zbl 07719141
Néraud, Jean
2
2022
Detecting morphic images of a word: On the rank of a pattern. Zbl 0843.68106
Neraud, Jean
1
1995
Algorithms for detecting morphic images of a word. Zbl 0835.68091
Neraud, Jean
1
1995
Conferences WORDS, years 1997–2017: open problems and conjectures. Zbl 1427.68259
Néraud, Jean
1
2018
Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms. Zbl 1405.68267
Néraud, Jean; Selmi, Carla
1
2017
Complete variable-length codes: an excursion into word edit operations. Zbl 1437.68103
Néraud, Jean
1
2020
Gray cycles of maximum length related to \(k\)-character substitutions. Zbl 07614748
Néraud, Jean
1
2021
Variable-length codes independent or closed with respect to edit relations. Zbl 07601277
Néraud, Jean
5
2022
When variable-length codes meet the field of error detection. Zbl 07719141
Néraud, Jean
2
2022
Gray cycles of maximum length related to \(k\)-character substitutions. Zbl 07614748
Néraud, Jean
1
2021
Embedding a \(\theta \)-invariant code into a complete one. Zbl 1436.68183
Néraud, Jean; Selmi, Carla
3
2020
Complete variable-length codes: an excursion into word edit operations. Zbl 1437.68103
Néraud, Jean
1
2020
Conferences WORDS, years 1997–2017: open problems and conjectures. Zbl 1427.68259
Néraud, Jean
1
2018
Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms. Zbl 1405.68267
Néraud, Jean; Selmi, Carla
1
2017
Completing circular codes in regular submonoids. Zbl 1135.68029
Néraud, Jean
5
2008
On the completion of codes in submonoids with finite rank. Zbl 1106.68062
Néraud, Jean
4
2006
Completing prefix codes in submonoids. Zbl 1093.94020
Néraud, Jean
3
2006
Completing a code in a regular submonoid of the free monoid (extended abstract). Zbl 1102.68499
Néraud, Jean
2
2005
A characterization of complete finite prefix codes in an arbitrary submonoid of \(A^*\). Zbl 1102.68071
Néraud, Jean; Selmi, Carla
3
2004
Free monoid theory: Maximality and completeness in arbitrary submonoids. Zbl 1064.68076
Néraud, Jean; Selmi, Carla
4
2003
Locally complete sets and finite decomposable codes. Zbl 0996.68055
Néraud, Jean; Selmi, Carla
3
2002
On codes with a finite deciphering delay: Constructing uncompletable words. Zbl 0974.68053
Néraud, J.; Selmi, C.
2
2001
Detecting morphic images of a word: On the rank of a pattern. Zbl 0843.68106
Neraud, Jean
1
1995
Algorithms for detecting morphic images of a word. Zbl 0835.68091
Neraud, Jean
1
1995
Equations in words: An algorithmic contribution. Zbl 0803.68097
Néraud, Jean
3
1994
Deciding whether a finite set of words has rank at most two. Zbl 0798.68088
Néraud, Jean
2
1993
On the rank of the subsets of a free monoid. Zbl 0779.20037
Néraud, Jean
2
1992
Elementariness of a finite set of words is co-NP-complete. Zbl 0704.68065
Neraud, Jean
10
1990
On the deficit of a finite set of words. Zbl 0679.20049
Néraud, Jean
3
1990
Unitary monoid with two generators: An algorithmic point of view. Zbl 0758.68053
Crochemore, M.; Neraud, J.
2
1990

Citations by Year