BIBLIOGRAPHIE
[G00]
Guesnet Y., On codes with finite interpreting delay: A defect theorem, Theoret. Informatics Appl. , 34 (2000) 47-59.
[G01.1]
Guesnet Y.,
Codes et interprétations,
Thèse de doctorat,
Université de Rouen,
2001.
[G01.2]
Guesnet Y., On maximal dense bifix codes, J. Automata, Languages and Combinatorics , 6 (2001) 263-273.
[G01.3]
Guesnet Y., Maximal circular codes versus maximal codes, Theoret. Informatics Appl. , 35 (2001) 361-365.
[G02]
Guesnet Y., On maximal codes with finite interpreting delay, Theoret. Comput. Sci. , 273 (2002) 167-183.
[G03]
Guesnet Y., On maximal synchronous codes, Theoret. Comput. Sci. , 307 (2003) 129-138.
[N90]
Néraud J., Elementariness of a finite set of words is co-NP-complete, Theoret. Informatics Appl. , 24 (1990) 459-470.
[N90.1]
Néraud J., On the deficit of a finite set of words, Semigroup Forum , 41 (1990) 1-21.
[N92]
Néraud J., On the rank of the subsets of a free monoid, Theoret. Comput. Sci. , 99 (1992) 231-241.
[N93]
Néraud J., Deciding whether a finite set of words has rank at most 2, Theoret. Comput. Sci. , 112 (1993) 311-337.
[N94]
Néraud J., Equations in words: an algorithmic contribution, Bull. of Belg. Math. Soc. , 1 (1994) 253-283.
[N95]
Néraud J., Algorithms for detecting morphic images of a word, Info. And Comput. , 120 (1995) 126-148.
[N95.1]
Néraud J., Detecting morphic images of a word: on the rank of a pattern, Acta Info. , 32 (1995) 477-489.
[N97]
Néraud J., Detecting morphic images of a word: improving the general algorithm, Theoret. Informatics Appl. , 31 (1997) 1-14.
[N99]
Néraud J.,
Guest Editor, "WORDS",
Theoret. Comput. Sci. , 218 (1999), Special Issue.
[N02]
Néraud J.,
Guest Editor, "WORDS",
Theoret. Comput. Sci. , 273 (2002), Special Issue.
[N03]
Néraud J.,
Guest Editor, "WORDS",
Theoret. Comput. Sci. , 307 (2003), Special Issue.
[NC92]
Néraud J. and Crochemore M., A string-matching interpretation of the equation , Theoret. Comput. Sci. , 92 (1992) 145-164.
[NS01]
Néraud J. and Selmi C., On codes with a finite deciphering delay: Constructing uncompletable words, Theoret. Comput. Sci. , 255 (2001) 151-162.
[NS02]
Néraud J. and Selmi C., Locally complete sets and finite decomposable codes, Theoret. Comput. Sci. , 273 (2002) 185-196.
[NS03]
Néraud J. and Selmi C., Free Monoid Theory:Maximality and Completeness in Arbitrary Submonoids, Intern. Journ. of Algebra and Comput. , 13 (2003) 507-516.
[NS04]
Néraud J. and Selmi C., A Characterization of Complete Finite Prefix Codes in a submonoid of , J. Automata, Languages and Combinatorics , 9 (2004) 103-110.
[S96]
Selmi C., Over testable languages, Theoret. Comput. Sci. , 161 (1996) 157-190.
[S99]
Selmi C., Strongly locally testable semigroups with commuting idempotents and related languages, Theoret. Comput. Sci. , 33 (1999) 47-57.
Page d'accueil de l'atelier
Présentation de l'atelier