{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:16Z","timestamp":1725663856563},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:10:55Z","timestamp":1330258255000},"page":"588-597","source":"Crossref","is-referenced-by-count":1,"title":["New algorithms for detecting morphic images of a word"],"prefix":"10.1007","author":[{"given":"Jean","family":"Neraud","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin D. Finding Patterns Common to a Set of Strings Journ. of Computer and Syst. Sci. 21, 46\u201362 (1980)","journal-title":"Journ. of Computer and Syst. Sci."},{"issue":"N.6","key":"50_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"Aho A. and M. Coracick. Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM (1975) Vol. 18, N.6, 333\u2013340","journal-title":"Comm. ACM"},{"key":"50_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico A. and F.P. Preparata. Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 22 (1983) 297\u2013315","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Baker K. Open problems on avoidable and unavoidable patterns, manuscript (Universit\u00e9 de Rouen, France)","key":"50_CR4"},{"issue":"10","key":"50_CR5","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"Boyer R.S.and J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (10) (1977) 62\u201372","journal-title":"Comm. ACM"},{"key":"50_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore M., An optimal algorithm for computing the repetitions in a word, Information Proc. Letters, 12 (1981), 244\u2013250","journal-title":"Information Proc. Letters"},{"doi-asserted-by":"crossref","unstructured":"Crochemore M. and J. N\u00e9raud. Unitary monoid with two generators: an algorithmic point of view, in: (Proceedings of CAAP'90), 1990","key":"50_CR7","DOI":"10.1007\/3-540-52590-4_44"},{"unstructured":"Crochemore M. and W. Rytter. Periodic prefixes of strings, in: (Acts of Sequences '91), 1991","key":"50_CR8"},{"unstructured":"Duval J. P. Contribution \u00e0 la combinatoire du monoide libre. Th\u00e8se de Doctorat d'Etat, Universit\u00e9 de Rouen, 1980","key":"50_CR9"},{"key":"50_CR10","series-title":"SIAM-AMS Proceedings, Vol. 7","first-page":"113","volume-title":"Complexity of Computation","author":"M. J. Fisher","year":"1974","unstructured":"Fisher M. J. and. M.S. Paterson, String Matching and other products, in: R.M. Karp ed., Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (Amer. Mathematical Soc. Providence, RI, 1974) 113\u2013125"},{"doi-asserted-by":"crossref","unstructured":"Galil Z., and J. Seiferas. Saving space in fast string-matching, SIAM J. Comput., 1980, 417\u2013438","key":"50_CR11","DOI":"10.1137\/0209032"},{"issue":"N.2","key":"50_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth D, Morris J. and V. Pratt. Fast pattern matching in string, SIAM J. Comput. (1977) Vol. 6, N. 2, 323\u2013350","journal-title":"SIAM J. Comput."},{"unstructured":"Lothaire M. \u201dCombinatorics on words\u201d, Encyclopedia of Mathematics and appl., Addison Wesley Publish. Company (1983)","key":"50_CR13"},{"key":"50_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G. Landau","year":"1988","unstructured":"Landau G. and U. Vishkin. Fast string Matching with k Differences, Journ. of Comput. and Sys. Sci (1988) Vol 37, 63\u201378","journal-title":"Journ. of Comput. and Sys. Sci"},{"key":"50_CR15","volume-title":"Combinatoric Algorithms on Words","author":"G. Main","year":"1985","unstructured":"Main G. and J. Lorentz. Linear time recognition of squarefree strings, in \u201dCombinatoric Algorithms on Words\u201d, A. Apostolico and Z. Galil editor, NATO ASI, Springer Verlag, Berlin (1985)"},{"issue":"1","key":"50_CR16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"E. Myers","year":"1989","unstructured":"Myers E. and W. Miller. Approximate matching of regular expressions, Bulletin of Mathematical Biology (1989) Vol. 51 (1), 5\u201337","journal-title":"Bulletin of Mathematical Biology"},{"doi-asserted-by":"crossref","unstructured":"N\u00e9raud J. Deciding a finite set of words has rank at least two, to appear in Theoretical Computer Science, Vol. 109 (1993)","key":"50_CR17","DOI":"10.1016\/0304-3975(93)90023-M"},{"key":"50_CR18","volume-title":"Combinatoric Algorithms on Words","author":"O. Rabin","year":"1985","unstructured":"Rabin O. Discovering repetitions in strings, in \u201d Combinatoric Algorithms on Words\u201d, A. Apostolico and Z. Galil editor, NATO ASI, Springer Verlag, Berlin (1985)"},{"doi-asserted-by":"crossref","unstructured":"Thomson K. Regular Expression Search Algorithm, Comm. of ACM (1968) Vol 11, N. 6","key":"50_CR19","DOI":"10.1145\/363347.363387"},{"doi-asserted-by":"crossref","unstructured":"Wagner R. and J. Seiferas. Correcting counter-automaton-recognizable languages, SIAM J. Comput. (1978) Vol. 7 (3)","key":"50_CR20","DOI":"10.1137\/0207029"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:44Z","timestamp":1605647324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}