Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Jean Néraud
Observed names:
J. Neraud,
J. Néraud,
JEAN NÉRAUD,
Jean Neraud,
Néraud, Jean
Institutions:
Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes,
Université de Rouen Normandie
Observed institutions:
Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes,
Université de Rouen Normandie
ORCID:
0000-0002-9630-461X
Observed ORCID:
0000-0002-9630-461X
OpenAlex ID:
A5045016946
Developments in Language Theory: 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings
2012
·
Giambruno, Laura
, Mantaci, Sabrina
, et al.
·
Lecture notes in computer science
·
27
Elementariness of a finite set of words is co-NP-complete
1990
·
Jean Neraud
·
RAIRO - Theoretical Informatics and Applications
·
26
PDF
Completing circular codes in regular submonoids
2007
·
Jean Néraud
·
Theoretical Computer Science
·
11
PDF
Free Monoid Theory: Maximality and Completeness in Arbitrary Submonoids
2003
·
JEAN NÉRAUD
, CARLA SELMI
·
International Journal of Algebra and Computation
·
10
On codes with a finite deciphering delay: constructing uncompletable words
2001
·
Jean Néraud
, Carla Selmi
·
Theoretical Computer Science
·
10
On the deficit of a finite set of words
1990
·
Jean Néraud
·
Semigroup Forum
·
10
Embedding a θ-invariant code into a complete one
2018
·
Jean Néraud
, Carla Selmi
·
Theoretical Computer Science
·
7
Locally complete sets and finite decomposable codes
2002
·
Jean Néraud
, Carla Selmi
·
Theoretical Computer Science
·
7
Deciding whether a finite set of words has rank at most two
1993
·
Jean Néraud
·
Theoretical Computer Science
·
7
On the rank of the subsets of a free monoid
1992
·
Jean Néraud
·
Theoretical Computer Science
·
7
Variable-length codes independent or closed with respect to edit relations
2021
·
Jean Néraud
·
Information and Computation
·
6
Completing prefix codes in submonoids
2006
·
Jean Néraud
·
Theoretical Computer Science
·
6
PDF
Completing a Code in a Regular Submonoid of the Free Monoid
2005
·
Jean Néraud
·
Lecture notes in computer science
·
6
Equations in words: an algorithmic contribution
1994
·
Jean Néraud
·
Bulletin of the Belgian Mathematical Society - Simon Stevin
·
6
PDF
Unitary monoid with two generators: An algorithmic point of view
1990
·
M. Crochemore
, J. Neraud
·
Lecture notes in computer science
·
5
A characterization of complete finite prefix codes in an arbitrary submonoid of A
2004
·
Selmi, Carla
, Néraud, Jean
·
HAL
·
4
On the Completion of Codes in Submonoids with Finite Rank
2006
·
Jean Néraud
·
Fundamenta Informaticae
·
3
When Variable-Length Codes Meet the Field of Error Detection
2022
·
Jean Néraud
·
Lecture notes in computer science
·
2
PDF
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
2018
·
Néraud, Jean
·
HAL
·
2
Algorithms for Detecting Morphic Images of a Word
1995
·
J. Neraud
·
Information and Computation
·
2
Detecting morphic images of a word On the rank of a pattern
1995
·
Jean Neraud
·
Acta Informatica
·
2
Topologies for error-detecting variable-length codes
2023
·
Jean Néraud
·
Information and Computation
·
1
PDF
Gray Cycles of Maximum Length Related to k-Character Substitutions
2021
·
Jean Néraud
·
Lecture notes in computer science
·
1
PDF
Complete Variable-Length Codes: An Excursion into Word Edit Operations
2020
·
Jean Néraud
·
Lecture notes in computer science
·
1
Complete Variable-Length Codes: An Excursion into Word Edit Operations
2019
·
Néraud, Jean
·
arXiv (Cornell University)
·
1
PDF
Show more works
View as search
Works count:
42
Citation count:
175
H-index:
7
I10-index:
6
Year
Topic
Type