{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:40:24Z","timestamp":1648892424203},"reference-count":19,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1051\/ita\/2011131","type":"journal-article","created":{"date-parts":[[2011,11,23]],"date-time":"2011-11-23T14:09:43Z","timestamp":1322057383000},"page":"33-50","source":"Crossref","is-referenced-by-count":0,"title":["An aperiodicity problem for multiwords"],"prefix":"10.1051","volume":"46","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Decan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Gauwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jef","family":"Wijsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,11,23]]},"reference":[{"key":"R1","unstructured":"Aho A.V. and Corasick M.J., Efficient string matching: An aid to bibliographic search.Commun. ACM18(1975) 333\u2013340."},{"key":"R2","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)."},{"key":"R3","unstructured":"Berstel J. and Boasson L., Partial words and a theorem of Fine and Wilf.Theoret. Comput. Sci.218(1999) 135\u2013141."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"F. Blanchet-Sadri,Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications). Chapman & Hall\/CRC (2007).","DOI":"10.1201\/9781420060935"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Boyer R.S. and Mooren J.S., A fast string searching algorithm.Commun. ACM20(1977) 762\u2013772.","DOI":"10.1145\/359842.359859"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"V. Bruy\u00e8re, A. Decan and J. Wijsen, On first-order query rewriting for incomplete database histories, inProc. of the 16th International Symposium on Temporal Representation and Reasoning (TIME)(2009) 54\u201361.","DOI":"10.1109\/TIME.2009.17"},{"key":"R7","unstructured":"M. Crochemore and W. Rytter,Text Algorithms. Oxford University Press (1994)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Hancart and T. Lecroq,Algorithms on Strings. Cambridge University Press (2007) 392.","DOI":"10.1017\/CBO9780511546853"},{"key":"R9","unstructured":"Fine N.J. and Wilf H.S., Uniqueness theorems for periodic functions.Proc. of Amer. Math. Soc.16(1965) 109\u2013114."},{"key":"R10","unstructured":"M.J. Fischer and M.S. Paterson, String matching and other products.SIAM-AMS Proceedings, Complexity of Computation7(1974) 113\u2013125."},{"key":"R11","unstructured":"Halava V., Harju T. and K\u00e4rki T., Relational codes of words.Theoret. Comput. Sci.389(2007) 237\u2013249."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Holub J., Smyth W.F. and Wang S., Fast pattern-matching on indeterminate strings.J. Discrete Algorithms6(2008) 37\u201350.","DOI":"10.1016\/j.jda.2006.10.003"},{"key":"R13","unstructured":"Knuth D.E., Morris J.H. and Pratt V.R., Fast pattern matching in strings.SIAM J. Comput.6(1977) 323\u2013350."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"G. Kucherov, L. No\u00e9 and M.A. Roytberg, Subset seed automaton, inProc. of the 12th International Conference on Implementation and Application of Automata (CIAA). Springer (2007) 180\u2013191.","DOI":"10.1007\/978-3-540-76336-9_18"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"M. Lothaire,Combinatorics on words. Cambridge University Press (1997).","DOI":"10.1017\/CBO9780511566097"},{"key":"R16","unstructured":"R. McNaughton and S. Papert,Counter-free Automata. MIT Press, Cambridge, MA (1971)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"J.-\u00c9. Pin,Varieties of Formal Languages. North Oxford, London and Plenum, New-York (1986).","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"R18","unstructured":"M.S. Rahman, C.S. Iliopoulos and L. Mouchard, Pattern matching in degenerate DNA\/RNA sequences, inWorkshop on Algorithms and Computation (WALCOM), edited by M. Kaykobad and M.S. Rahman. Bangladesh Academy of Sciences (BAS) (2007) 109\u2013120."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger M.P., On finite monoids having only trivial subgroups.Inform. Control8(1965) 190\u2013194.","DOI":"10.1016\/S0019-9958(65)90108-7"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011131\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T23:51:27Z","timestamp":1560988287000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,23]]},"references-count":19,"journal-issue":{"issue":"1"},"alternative-id":["ita100049"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011131","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,23]]}}}