{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:41Z","timestamp":1725543461154},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_35","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"386-396","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Degenerated Three Dimensional Billiard Words"],"prefix":"10.1007","author":[{"given":"J. -P.","family":"Borel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic sequences: Theory and Applications","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic sequences: Theory and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.24033\/bsmf.2220","volume":"122","author":"P. Arnoux","year":"1994","unstructured":"Arnoux, P., Mauduit, C., Shiokawa, I., Tamura, J.I.: Complexity of sequences defined by billiard in the cube. Bull. Soc. Math. France\u00a0122, 1\u201312 (1994)","journal-title":"Bull. Soc. Math. France"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.24033\/bsmf.2164","volume":"119","author":"P. Arnoux","year":"1991","unstructured":"Arnoux, P., Rauzy, G.: Repr\u00e9sentation g\u00e9omtrique de suites de complexit\u00e9 2n\u2009+\u20091. Bull. Soc. Math. France\u00a0119, 199\u2013215 (1991)","journal-title":"Bull. Soc. Math. France"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02099463","volume":"174","author":"Y. Baryshnikov","year":"1995","unstructured":"Baryshnikov, Y.: Complexity of trajectories in rectangular billiards. Comm. Math. Phys.\u00a0174, 43\u201356 (1995)","journal-title":"Comm. Math. Phys."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e9daride, N.: Etude du billard dans un polyh\u00e9dre, PhD Thesis, Univ. Aix-Marseille (2005)","DOI":"10.5802\/tsg.243"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1070\/RD2003v008n01ABEH000228","volume":"8","author":"N. B\u00e9daride","year":"2003","unstructured":"B\u00e9daride, N.: Billiard complexity in rational polyhedra. Regul Chaotic Dyn.\u00a08, 97\u2013104 (2003)","journal-title":"Regul Chaotic Dyn."},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0304-3975(96)00101-6","volume":"178","author":"J. Berstel","year":"1997","unstructured":"Berstel, J., de Luca, A.: Sturmian words, Lyndon words and trees. Theoret. Comput. Sci.\u00a0178, 171\u2013203 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR8","volume-title":"Algebraic combinatorics on words","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., S\u00e9\u00e9bold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic combinatorics on words. Cambridge University Press, Cambridge (2002)"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.tcs.2005.03.036","volume":"340-2","author":"J.-P. Borel","year":"2005","unstructured":"Borel, J.-P., Reutenauer, C.: Palindromic factors of billiard words. Theoret. Comput. Sci.\u00a0340-2, 334\u2013348 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11505877_16","volume-title":"Developments in Language Theory","author":"J.-P. Borel","year":"2005","unstructured":"Borel, J.-P., Reutenauer, C.: Some new results on palindromic factors of billiard words. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 180\u2013188. Springer, Heidelberg (2005)"},{"key":"35_CR11","unstructured":"Borel, J.-P.: Complexity and palindromic complexity of billiard words. In: Brlek, Reutenauer (eds.) WORDS 2005 5th Intern. Conf. on Words, vol.\u00a036, pp. 175\u2013184. Publ. LACIM Montral (2005)"},{"key":"35_CR12","unstructured":"Bourbaki, N.: Topologie g\u00e9n\u00e9rale, ch. 5-10, Herman, Paris (1974)"},{"key":"35_CR13","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\u00a04, 67\u201388 (1997)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"key":"35_CR14","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. Theoret. Comput. Sci.\u00a0183, 45\u201382 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-63246-8_15","volume-title":"Structures in Logic and Computer Science","author":"A. Luca de","year":"1997","unstructured":"de Luca, A.: Combinatorics of standard Sturmian words, in Structures in Logic and Computer Science. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 249\u2013267. Springer, Heidelberg (1997)"},{"key":"35_CR16","unstructured":"Rauzy, G.: Des mots en arithmetique. In: Avignon Conf. on Language Theory and Algorithmic Complexity 1983, Lyon, pp. 103\u2013113. Univ. Claude-Bernard (1984)"},{"key":"35_CR17","unstructured":"Rauzy, G.: Sequences with terms in a finite alphabet, Seminar on Number Theory Univ. Bordeaux I, vol.\u00a025, p. 16 (1983)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:07:02Z","timestamp":1605625622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11779148_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}