{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T23:28:04Z","timestamp":1685489284362},"reference-count":8,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1992]]},"DOI":"10.1051\/ita\/1992260403031","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:56:35Z","timestamp":1486029395000},"page":"303-317","source":"Crossref","is-referenced-by-count":4,"title":["Enumeration of bordered words, le langage de la vache-qui-rit"],"prefix":"10.1051","volume":"26","author":[{"given":"M.","family":"R\u00e9gnier","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"[CP] CROCHEMORE M. and PERRIN D., Pattern matching in strings, L.I.T.P., Paris, Research Report, 88-5."},{"key":"R2","unstructured":"[Dar78] DARBOUX G., M\u00e9moire sur l'approximation des fonctions de tr\u00e8s grands nombres, et sur une classe \u00e9tendue de d\u00e9veloppements en s\u00e9rie, J. Math. Pures Appl., f\u00e9vrier 1978, pp. 5-56, 377-416.23540510.0279.01"},{"key":"R3","unstructured":"[Fla84] FLAJOLET , Algorithmique, in Encyclopedia Universalis, 1, pp. 758-763. \u00c9ditions de l'E. U., 1984."},{"key":"R4","unstructured":"[GJ83] GOULDEN I. P. and JACKSON D. M., Combinatorial Enumeration, John Wiley, New York, 1983.7025120519.05001"},{"key":"R5","unstructured":"[Lot83] LOTHAIRE , Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983.6759530514.20045"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[Odl85] ODLYZKO A., Enumeration of strings, in A. APOSTOLICO and Z. GALIL Ed., Combinatorial Algorithms on Words, 12 of NATO Advance Science Institute Series, Series F: Computer and Systems Sciences, pp. 203-228, Springer Verlag, 1985.8153270603.68074","DOI":"10.1007\/978-3-642-82456-2_14"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"{R\u00e9g89] R\u00c9GNIER M., Knuth-Morris-Pratt algorithm: an analysis, in MFCS'89, 379, Lecture Notes in Comput. Sci., pp. 431-444, Springer-Verlag, 1989. Proc. Mathematical Foundations for Computer Science 89, Porubka, Poland.10368220755.68074","DOI":"10.1007\/3-540-51486-4_90"},{"key":"R8","unstructured":"[Ste84] STEYAERT J.-M., Structure et complexit\u00e9 des algorithmes. Th\u00e8se d'\u00c9tat, Universit\u00e9 de Paris-VII, 1984."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260403031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:55:44Z","timestamp":1568771744000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1992260403031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"references-count":8,"journal-issue":{"issue":"4"},"alternative-id":["ita1992260403031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1992260403031","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}