@article{ITA_1997__31_1_1_0, author = {N\'eraud, Jean}, title = {Detecting the morphic images of a word : improving the general algorithm}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {1--14}, publisher = {EDP-Sciences}, volume = {31}, number = {1}, year = {1997}, mrnumber = {1460455}, zbl = {0878.68079}, language = {en}, url = {http://www.numdam.org/item/ITA_1997__31_1_1_0/} }
TY - JOUR AU - Néraud, Jean TI - Detecting the morphic images of a word : improving the general algorithm JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1997 SP - 1 EP - 14 VL - 31 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1997__31_1_1_0/ LA - en ID - ITA_1997__31_1_1_0 ER -
%0 Journal Article %A Néraud, Jean %T Detecting the morphic images of a word : improving the general algorithm %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1997 %P 1-14 %V 31 %N 1 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1997__31_1_1_0/ %G en %F ITA_1997__31_1_1_0
Néraud, Jean. Detecting the morphic images of a word : improving the general algorithm. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 1, pp. 1-14. http://www.numdam.org/item/ITA_1997__31_1_1_0/
[An 80] Finding Patterns Common to a Set of Strings, Journal of Computer and Syst. Sci., 1980, 21, pp. 46-62. | MR | Zbl
,[AC 75] Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM, 1975. | MR | Zbl
and ,[AP 83] Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 1983, 22, pp. 297-315. | MR | Zbl
and ,[B 92] Open problems on avoidable and unavoidable patterns, manuscript (Université de Rouen, France).
,[C 81] An optimal algorithm for computing the repetitions in a word, Information Proc. Letters, 1981, 12, pp. 244-250. | MR | Zbl
,[CN 89] Unitary monoid with two generators: an algorithmic point of view, in: Proceedings of CAAP'90, 1990. | MR | Zbl
and ,[CLR 90] "Introduction to Algorithm", The MIT Press, 1990 | Zbl
, and ,[CR 91] Periodic prefixes of string, in: Acts of Sequences '91, 1991.
and ,[CR 94] "Text Algoriths", Oxford University Press, 1994. | MR | Zbl
and ,[GS 83] Saving space in fast string-matching, SIAM J. Comput., 1980, pp. 417-438. | MR | Zbl
and ,[JSSY 95] Decision problems for patters, Journ. of Comput. Syst. Sci., 1995, 50(1), pp. 53-63. | MR | Zbl
, , and ,[K 73] "Sorting and Searching", vol. 3, of "The Art of Computer Programming". Addison Wesley 1969, Second edition, 1981. | Zbl
,[KMP 77] Fast pattern matching in string, SIAM J. Comput., 1977, 6, No. 2, pp. 323-350. | MR | Zbl
, and ,[Lo 83] "Compbinatorics on words", Encyclopedia of Mathematics and appl., Addison Wesley Publish. Company, 1983. | MR | Zbl
,[ML 85] Linear time recognition of squarefree string, in "Combinatoric Algorithms on Words", A. Apostolica and Z. Galil eds., NATO ASI, Springer Verlag, Berlin, 1985 (1), pp. 5-37 | MR | Zbl
and ,[N 95] Algorithms for detecting morphic images of a word, Info. and Comput., 1995,120, No. 1, pp. 126-148. | MR | Zbl
,[N 95.1] Detecting morphic images of a word: On the rank of a pattern, Acta Info., 1994. | MR | Zbl
,[R 85] Discovering repetitions in string, in "Combinatoric Algorithms on Words", A. Apostolico and Z. Galil eds., NATO ASI, Springer Verlag, Berlin, 1985. | MR | Zbl
,