{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:36Z","timestamp":1725517176860},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_21","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"265-277","source":"Crossref","is-referenced-by-count":4,"title":["On a Special Class of Primitive Words"],"prefix":"10.1007","author":[{"given":"Elena","family":"Czeizler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J. Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. WORDS 1997 (Rouen), Theoret. Comput. Sci.\u00a0218(1), 135\u2013141 (1999)","journal-title":"WORDS 1997 (Rouen), Theoret. Comput. Sci."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhumaki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Berlin (1997)"},{"issue":"1","key":"21_CR3","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.: Generalized Fine and Wilfs theorem for arbitrary number of periods. Theoret. Comput. Sci.\u00a0339(1), 49\u201360 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR4","first-page":"167","volume":"89","author":"S. Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for abelian periods. Bulletin of EATCS\u00a089, 167\u2013170 (2006)","journal-title":"Bulletin of EATCS"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proc. Amer. Math. Soc.\u00a016, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"21_CR6","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick Conjugate and Commutative Words. In: Garzon, M., Yan, H. (eds.) Preproceedings of the International Conference on DNA 13, pp. 75\u201387 (2007)"},{"key":"21_CR7","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick Palindromes (submitted)"},{"key":"21_CR8","volume-title":"Combinatorics on words, Encyclopedia of Mathematics and its applications 17","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words, Encyclopedia of Mathematics and its applications 17. Addison-Wesley Publishing Co, Reading (1983)"},{"key":"21_CR9","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. Theoret. Comput. Sci.\u00a0362, 282\u2013300 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"21_CR10","first-page":"245","volume":"292","author":"F. Mignosi","year":"2003","unstructured":"Mignosi, F., Restivo, A., Silva, P.S.: On Fine and Wilfs theorem for bidimensional words. Selected papers in honor of Jean Berstel, Theoret. Comput. Sci.\u00a0292(1), 245\u2013262 (2003)","journal-title":"Selected papers in honor of Jean Berstel, Theoret. Comput. Sci."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-08442-8_83","volume-title":"Proc. FCT77","author":"H.J. Shyr","year":"1977","unstructured":"Shyr, H.J., Thierrin, G.: Disjunctive languages and codes. In: Proc. FCT77. LNCS, vol.\u00a056, pp. 171\u2013176. Springer, Heidelberg (1977)"},{"key":"21_CR12","unstructured":"Yu, S.S.: Languages and Codes, Lecture Notes, Department of Computer Science. National Chung-Hsing University, Taichung, Taiwan 402 (2005)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:31:13Z","timestamp":1619523073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}