{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:57:01Z","timestamp":1743127021783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_17","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"215-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enumeration Formul\u00e6 in Neutral Sets"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Dolce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"3\u20134","key":"17_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00605-008-0001-2","volume":"155","author":"\u0139 Balkov\u00e1","year":"2008","unstructured":"Balkov\u00e1, \u0139., Pelantov\u00e1, E., Steiner, W.: Sequences with constant number of return words. Monatsh. Math. 155(3\u20134), 251\u2013263 (2008)","journal-title":"Monatsh. Math."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jalgebra.2012.07.013","volume":"369","author":"J Berstel","year":"2012","unstructured":"Berstel, J., De Felice, C., Perrin, D., Reutenauer, C., Rindone, G.: Bifix codes and Sturmian words. J. Algebra 369, 146\u2013202 (2012)","journal-title":"J. Algebra"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195768"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., De Felice, C., Delecroix, V., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Specular sets. In: Preparation (2015). (http:\/\/arxiv.org\/abs\/1505.00707)","DOI":"10.1007\/978-3-319-23660-5_18"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","volume":"176","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Acyclic, connected and tree sets. Monatsh. Math. 176(4), 521\u2013550 (2015)","journal-title":"Monatsh. Math."},{"issue":"7","key":"17_CR6","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1016\/j.jpaa.2014.09.028","volume":"219","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Bifix codes and interval exchanges. J. Pure Appl. Algebra 219(7), 2781\u20132798 (2015)","journal-title":"J. Pure Appl. Algebra"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.1016\/j.jpaa.2014.09.014","volume":"219","author":"V Berth\u00e9","year":"2015","unstructured":"Berth\u00e9, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: The finite index basis property. J. Pure Appl. Algebra 219, 2521\u20132537 (2015)","journal-title":"J. Pure Appl. Algebra"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., De Felice, C., Dolce, F., Leroy, J., Perrin, D., Reutenauer, C., Rindone, G.: Maximal bifix decoding. Discrete Math (2015)","DOI":"10.1016\/j.disc.2014.12.010"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., Delecroix, V., Dolce, F., Perrin, D., Reutenauer, C., Rindone, G.: Return words of linear involutions and fundamental groups (2015). (http:\/\/arxiv.org\/abs\/1405.3529)","DOI":"10.1017\/etds.2015.74"},{"key":"17_CR10","series-title":"Encyclopedia Math. Appl.","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777653","volume-title":"Combinatorics, automata and number theory","author":"V Berth\u00e9","year":"2010","unstructured":"Berth\u00e9, V., Rigo, M.: Combinatorics, automata and number theory. Encyclopedia Math. Appl., vol. 135. Cambridge Univ. Press, Cambridge (2010)"},{"issue":"46","key":"17_CR11","doi-asserted-by":"publisher","first-page":"6455","DOI":"10.1016\/j.tcs.2011.08.007","volume":"412","author":"AB Mass\u00e9","year":"2011","unstructured":"Mass\u00e9, A.B., Brlek, S., Labb\u00e9, S., Vuillon, L.: Palindromic complexity of codings of rotations. Theoret. Comput. Sci. 412(46), 6455\u20136463 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"17_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.36045\/bbms\/1105730624","volume":"4","author":"J Cassaigne","year":"1997","unstructured":"Cassaigne, J.: Complexit\u00e9 et facteurs sp\u00e9ciaux. Bull. Belg. Math. Soc. Simon Stevin 4(1), 67\u201388 (1997). Journ\u00e9es Montoises (Mons, 1994)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"5","key":"17_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1051\/ita:2000121","volume":"34","author":"J Justin","year":"2000","unstructured":"Justin, J., Vuillon, L.: Return words in Sturmian and episturmian words. Theor. Inform. Appl. 34(5), 343\u2013356 (2000)","journal-title":"Theor. Inform. Appl."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01236981","volume":"141","author":"M Keane","year":"1975","unstructured":"Keane, M.: Interval exchange transformations. Math. Z. 141, 25\u201331 (1975)","journal-title":"Math. Z."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1088\/0951-7715\/26\/2\/525","volume":"26","author":"A Nogueira","year":"2013","unstructured":"Nogueira, A., Pires, B., Troubetzkoy, S.: Orbit structure of interval exchange transformations with flip. Nonlinearity 26(2), 525\u2013537 (2013)","journal-title":"Nonlinearity"},{"issue":"3\u20134","key":"17_CR16","first-page":"345","volume":"18","author":"L Vuillon","year":"2007","unstructured":"Vuillon, L.: On the number of return words in infinite words constructed by interval exchange transformations. Pure Math. Appl. (PU.M.A.) 18(3\u20134), 345\u2013355 (2007)","journal-title":"Pure Math. Appl. (PU.M.A.)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:12:28Z","timestamp":1676466748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}