Jean Neraud - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2012

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering DelayLaura Giambruno, Sabrina Mantaci, Jean Neraud, Carla Selmi. dlt 2012: 471-476 [doi]

2008

Completing circular codes in regular submonoidsJean Neraud. TCS, 391(1-2):90-98, 2008. [doi]

2006

On the Completion of Codes in Submonoids with Finite RankJean Neraud. FUIN, 74(4):549-562, 2006. [doi]

Completing prefix codes in submonoidsJean Neraud. TCS, 356(1-2):245-254, 2006. [doi]

2004

Completing a Code in a Regular Submonoid of the Free MonoidJean Neraud. mcu 2005: 281-291 [doi]

A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A:::*:::Jean Neraud, Carla Selmi. jalc, 9(1):103-110, 2004.

2003

Free Monoid Theory: Maximality And Completeness in Arbitrary SubmonoidsJean Neraud, Carla Selmi. ijac, 13(5):507-516, 2003. [doi]

2002

WORDS 99 - PrefaceJean Neraud. TCS, 273(1-2):1-3, 2002. [doi]

Locally complete sets and finite decomposable codesJean Neraud, Carla Selmi. TCS, 273(1-2):185-196, 2002. [doi]

2001

On codes with a finite deciphering delay: constructing uncompletable wordsJean Neraud, Carla Selmi. TCS, 255(1-2):151-162, 2001. [doi]

1997

Detecting the Morphic Images of a Word: Improving the General AlgorithmJean Neraud. ita, 31(1):1-14, 1997.

1995

Detecting Morphic Images of a Word on the Rank of a PatternJean Neraud. ACTA, 32(5):477-489, 1995.

Algorithms for Detecting Morphic Images of a WordJean Neraud. iandc, 120(1):126-148, July 1995.

1993

New Algorithms for Detecting Morphic Images of a WordJean Neraud. mfcs 1993: 588-597

Deciding Whether a Finite Set of Words has Rank at Most TwoJean Neraud. TCS, 112(2):311-337, 1993.

1992

A String-Matching Interpretation of the Equation xmyn = zpJean Neraud, Maxime Crochemore. TCS, 92(1):145-164, 1992.

On the Rank of the Subsets of a Free MonoidJean Neraud. TCS, 99(2):231-241, 1992.

1991

On the Subsets of Rank Two in a Free Monoid: A Fast Decision AlgorithmJean Neraud. iwwert 1993: 187-196

On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract)Jean Neraud. fct 1991: 360-369

1990

Unitary Monoid with Two Generators: An Algorithmic Point of ViewMaxime Crochemore, Jean Neraud. caap 1990: 117-131

Elementariness of a finite set of words is co-NP-completeJean Neraud. ita, 24:459-470, 1990.

Sign in or sign up to see more results.

runs on WebDSL