| Elementariness of a finite set of words is co-NP-complete J Néraud RAIRO-Theoretical Informatics and Applications 24 (5), 459-470, 1990 | 33 | 1990 |
| On codes with a finite deciphering delay: constructing uncompletable words J Néraud, C Selmi Theoretical computer science 255 (1-2), 151-162, 2001 | 11 | 2001 |
| On the rank of the subsets of a free monoid J Néraud Theoretical computer science 99 (2), 231-241, 1992 | 9 | 1992 |
| On the deficit of a finite set of words J Néraud Semigroup forum 41, 1-21, 1990 | 9 | 1990 |
| Free monoid theory: Maximality and completeness in arbitrary submonoids J Néraud, C Selmi International Journal of Algebra and Computation 13 (05), 507-516, 2003 | 8 | 2003 |
| Locally complete sets and finite decomposable codes J Néraud, C Selmi Theoretical computer science 273 (1-2), 185-196, 2002 | 8 | 2002 |
| Deciding whether a finite set of words has rank at most two J Néraud Theoretical computer science 112 (2), 311-337, 1993 | 8 | 1993 |
| Completing circular codes in regular submonoids J Néraud Theoretical computer science 391 (1-2), 90-98, 2008 | 7 | 2008 |
| Equations in words: an algorithmic contribution J Néraud Bulletin of the Belgian Mathematical Society-Simon Stevin 1 (2), 253-283, 1994 | 7 | 1994 |
| Unitary monoid with two generators: an algorithmic point of view M Crochemore, J Néraud Colloquium on Trees in Algebra and Programming, CAAP' 90 431, 117-131, 1990 | 7 | 1990 |
| A characterization of complete finite prefix codes in an arbitrary submonoid of A J Néraud, C Selmi Journal of Automata Languages and Combinatorics 9, 103-110, 2004 | 6 | 2004 |
| Variable-length codes independent or closed with respect to edit relations J Néraud Information and Computation 288, 104747, 2022 | 5 | 2022 |
| On the completion of codes in submonoids with finite rank J Néraud Fundamenta Informaticae 74 (4), 549-562, 2006 | 5 | 2006 |
| Words WORDS (2, 1999, Rouen), J Néraud Elsevier, 2002 | 5 | 2002 |
| Embedding a θ-invariant code into a complete one J Néraud, C Selmi Theoretical Computer Science 806, 28-41, 2020 | 4 | 2020 |
| Completing prefix codes in submonoids J Néraud Theoretical computer science 356 (1-2), 245-254, 2006 | 4 | 2006 |
| Completing a Code in a Regular Submonoid of the Free Monoid J Neraud Lecture Notes in Computer Science 3354, 281-291, 2005 | 4 | 2005 |
| When Variable-Length Codes Meet the Field of Error Detection J Néraud International Conference on Algebraic Informatics, 203-222, 2022 | 2 | 2022 |
| Conferences WORDS, years 1997-2017: Open Problems and Conjectures J Néraud Bulletin of EATCS 2 (125), 2018 | 2 | 2018 |
| On the Contribution of WORDS to the Field of Combinatorics on Words J Néraud International Conference on Combinatorics on Words, 27-34, 2015 | 2 | 2015 |
