| 2008 |
|---|
| 20 | EE | Jean Neraud:
Completing circular codes in regular submonoids.
Theor. Comput. Sci. 391(1-2): 90-98 (2008) |
| 2006 |
|---|
| 19 | EE | Jean Neraud:
On the Completion of Codes in Submonoids with Finite Rank.
Fundam. Inform. 74(4): 549-562 (2006) |
| 18 | EE | Jean Neraud:
Completing prefix codes in submonoids.
Theor. Comput. Sci. 356(1-2): 245-254 (2006) |
| 2004 |
|---|
| 17 | EE | Jean Neraud:
Completing a Code in a Regular Submonoid of the Free Monoid.
MCU 2004: 281-291 |
| 16 | | Jean Neraud,
Carla Selmi:
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*.
Journal of Automata, Languages and Combinatorics 9(1): 103-110 (2004) |
| 2003 |
|---|
| 15 | EE | Jean Neraud,
Carla Selmi:
Free Monoid Theory: Maximality And Completeness in Arbitrary Submonoids.
IJAC 13(5): 507-516 (2003) |
| 2002 |
|---|
| 14 | EE | Jean Neraud:
WORDS '99 - Preface.
Theor. Comput. Sci. 273(1-2): 1-3 (2002) |
| 13 | EE | Jean Neraud,
Carla Selmi:
Locally complete sets and finite decomposable codes.
Theor. Comput. Sci. 273(1-2): 185-196 (2002) |
| 2001 |
|---|
| 12 | EE | Jean Neraud,
Carla Selmi:
On codes with a finite deciphering delay: constructing uncompletable words.
Theor. Comput. Sci. 255(1-2): 151-162 (2001) |
| 1997 |
|---|
| 11 | | Jean Neraud:
Detecting the Morphic Images of a Word: Improving the General Algorithm.
ITA 31(1): 1-14 (1997) |
| 1995 |
|---|
| 10 | | Jean Neraud:
Detecting Morphic Images of a Word on the Rank of a Pattern
Acta Inf. 32(5): 477-489 (1995) |
| 9 | | Jean Neraud:
Algorithms for Detecting Morphic Images of a Word
Inf. Comput. 120(1): 126-148 (1995) |
| 1993 |
|---|
| 8 | | Jean Neraud:
New Algorithms for Detecting Morphic Images of a Word.
MFCS 1993: 588-597 |
| 7 | | Jean Neraud:
Deciding Whether a Finite Set of Words has Rank at Most Two.
Theor. Comput. Sci. 112(2): 311-337 (1993) |
| 1992 |
|---|
| 6 | | Jean Neraud,
Maxime Crochemore:
A String-Matching Interpretation of the Equation xmyn = zp.
Theor. Comput. Sci. 92(1): 145-164 (1992) |
| 5 | | Jean Neraud:
On the Rank of the Subsets of a Free Monoid.
Theor. Comput. Sci. 99(2): 231-241 (1992) |
| 1991 |
|---|
| 4 | | Jean Neraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract).
FCT 1991: 360-369 |
| 3 | | Jean Neraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm.
IWWERT 1991: 187-196 |
| 1990 |
|---|
| 2 | | Maxime Crochemore,
Jean Neraud:
Unitary Monoid with Two Generators: An Algorithmic Point of View.
CAAP 1990: 117-131 |
| 1 | | Jean Neraud:
Elementariness of a finite set of words is co-NP-complete.
ITA 24: 459-470 (1990) |
