The following pages link to Jean Néraud (Q782606):
Displaying 32 items.
- (Q197709) (redirect page) (← links)
- Complete variable-length codes: an excursion into word edit operations (Q782607) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- On the rank of the subsets of a free monoid (Q1193899) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- Equations in words: An algorithmic contribution (Q1326954) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms (Q1678355) (← links)
- On the deficit of a finite set of words (Q1822632) (← links)
- Algorithms for detecting morphic images of a word (Q1898485) (← links)
- Detecting morphic images of a word: On the rank of a pattern (Q1899100) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- Completing prefix codes in submonoids. (Q2490823) (← links)
- (Q3416096) (← links)
- On the Contribution of WORDS to the Field of Combinatorics on Words (Q3449354) (← links)
- Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)
- (Q4027623) (← links)
- (Q4266527) (← links)
- (Q4266532) (← links)
- Detecting the morphic images of a word : improving the general algorithm (Q4348237) (← links)
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS (Q4464961) (← links)
- (Q4654644) (← links)
- (Q5203929) (← links)
- Machines, Computations, and Universality (Q5710887) (← links)
- A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay (Q5894977) (← links)
- A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay (Q5899549) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- Topologies for error-detecting variable-length codes (Q6186320) (← links)
