{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:06Z","timestamp":1725466626654},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_28","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"308-319","source":"Crossref","is-referenced-by-count":1,"title":["Pseudoperiodic Words"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Blondin Mass\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Gaboury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Hall\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N. Fine","year":"1965","unstructured":"Fine, N., Wilf, H.: Uniqueness theorems for periodic functions. Proceeding of American Mathematical Society\u00a016, 109\u2013114 (1965)","journal-title":"Proceeding of American Mathematical Society"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR4","unstructured":"Shallit, J.: 50 years of Fine and Wilf, Talk given in Waterloo Workshop in Computer Algebra, Canada (2011), \n                    \n                      http:\/\/www.cs.uwaterloo.ca\/~shallit\/Talks\/wilf3.pdf"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(98)00251-5","volume":"218","author":"M. Castelli","year":"1999","unstructured":"Castelli, M., Mignosi, F., Restivo, A.: Fine and Wilf\u2019s theorem for three periods and a generalization of Sturmian words. Theoretical Computer Science\u00a0218(1), 83\u201394 (1999)","journal-title":"Theoretical Computer Science"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1051\/ita:2000122","volume":"34","author":"J. Justin","year":"2000","unstructured":"Justin, J.: On a paper by Castelli, Mignosi, Restivo. RAIRO - Theoretical Informatics and Applications\u00a034, 373\u2013377 (2000)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1051\/ita:2006042","volume":"40","author":"S. Holub","year":"2006","unstructured":"Holub, S.: On multiperiodic words. RAIRO - Theoretical Informatics and Applications\u00a040, 583\u2013591 (2006)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2005.01.007","volume":"339","author":"S. Constantinescu","year":"2005","unstructured":"Constantinescu, S., Ilie, L.: Generalised Fine and Wilf\u2019s theorem for arbitrary number of periods. Theoretical Computer Science\u00a0339(1), 49\u201360 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1090\/S0002-9939-03-06970-3","volume":"131","author":"R.J. Simpson","year":"2003","unstructured":"Simpson, R.J., Tijdeman, R.: Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester. Proceedings of the American Mathematical Society\u00a0131(6), 1661\u20131671 (2003)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(01)00226-2","volume":"292","author":"F. Mignosi","year":"2003","unstructured":"Mignosi, F., Restivo, A., Silva, P.V.: On Fine and Wilf\u2019s theorem for bidimensional words. Theor. Comput. Sci.\u00a0292, 245\u2013262 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"30-32","key":"28_CR11","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1016\/j.tcs.2009.02.004","volume":"410","author":"R. Tijdeman","year":"2009","unstructured":"Tijdeman, R., Zamboni, L.Q.: Fine and Wilf words for any periods II. Theoretical Computer Science\u00a0410(30-32), 3027\u20133034 (2009)","journal-title":"Theoretical Computer Science"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-02737-6_14","volume-title":"Developments in Language Theory","author":"E. Czeizler","year":"2009","unstructured":"Czeizler, E., Czeizler, E., Kari, L., Seki, S.: An Extension of the Lyndon Sch\u00fctzenberger Result to Pseudoperiodic Words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 183\u2013194. Springer, Heidelberg (2009)"},{"key":"28_CR13","unstructured":"Blondin Mass\u00e9, A., Paquin, G., Vuillon, L.: A Fine and Wilf\u2019s theorem for pseudoperiods and Justin\u2019s formula for generalized pseudostandard words. 8e Journ\u00e9es Montoises d\u2019informatique Th\u00e9orique (September 2010)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0019-3577(03)90076-0","volume":"14","author":"R. Tijdeman","year":"2003","unstructured":"Tijdeman, R., Zamboni, L.Q.: Fine and Wilf words for any periods. Indag. Math.\u00a014, 200\u2013203 (2003)","journal-title":"Indag. Math."},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","volume":"136","author":"A. Luca de","year":"1994","unstructured":"de Luca, A., Mignosi, F.: Some combinatorial properties of sturmian words. Theoretical Computer Science\u00a0136(2), 361\u2013385 (1994)","journal-title":"Theoretical Computer Science"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"A. Luca de","year":"1997","unstructured":"de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theoretical Computer Science\u00a0183, 45\u201382 (1997)","journal-title":"Theoretical Computer Science"},{"key":"28_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"28_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"issue":"1-3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A. Luca de","year":"2006","unstructured":"de Luca, A., De Luca, A.: Pseudopalindrome closure operators in free monoids. Theoretical Computer Science\u00a0362(1-3), 282\u2013300 (2006)","journal-title":"Theoretical Computer Science"},{"key":"28_CR20","unstructured":"Blondin Mass\u00e9, A., Brlek, S., Garon, A., Labb\u00e9, S.: Palindromes and local periodicity. In: Words 2009, 7th Int. Conf. on Words (2009), electronic proceedings"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:34Z","timestamp":1620128494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}