{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:27:27Z","timestamp":1742916447208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"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-23660-5_15","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"170-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mechanical Proofs of Properties of the Tribonacci Word"],"prefix":"10.1007","author":[{"given":"Hamoon","family":"Mousavi","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1016\/j.tcs.2009.02.006","volume":"410","author":"JP Allouche","year":"2009","unstructured":"Allouche, J.P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci. 410, 2795\u20132803 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"15_CR3","first-page":"314","volume":"42","author":"E Barcucci","year":"2004","unstructured":"Barcucci, E., B\u00e9langer, L., Brlek, S.: On Tribonacci sequences. Fibonacci Quart. 42, 314\u2013319 (2004)","journal-title":"Fibonacci Quart."},{"key":"15_CR4","volume-title":"Noncommutative Rational Series with Applications, Encylopedia of Mathematics and Its Applications","author":"J Berstel","year":"2011","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications, Encylopedia of Mathematics and Its Applications, vol. 137. Cambridge University Press, Cambridge (2011)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(96)00260-5","volume":"181","author":"V Bruy\u00e8re","year":"1997","unstructured":"Bruy\u00e8re, V., Hansel, G.: Bertrand numeration systems and recognizability. Theoret. Comput. Sci. 181, 17\u201343 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C.,Villemaire, R.: Logic and $$p$$-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 191\u2013238 (1994), corrigendum. Bull. Belg. Math. Soc. 1, 577 (1994)","DOI":"10.36045\/bbms\/1103408547"},{"key":"15_CR7","unstructured":"Carlitz, L., Scoville, R., Hoggatt, Jr., V.E.: Fibonacci representations of higher order. Fibonacci Quart. 10, 43\u201369, 94 (1972)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1142\/S0129054112400448","volume":"23","author":"E Charlier","year":"2012","unstructured":"Charlier, E., Rampersad, N., Shallit, J.: Enumeration and decidable properties of automatic sequences. Int. J. Found. Comp. Sci. 23, 1035\u20131066 (2012)","journal-title":"Int. J. Found. Comp. Sci."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.5802\/jtnb.328","volume":"13","author":"N Chekhova","year":"2001","unstructured":"Chekhova, N., Hubert, P., Messaoudi, A.: Propri\u00e9t\u00e9s combinatoires, ergodiques et arithm\u00e9tiques de la substitution de Tribonacci. J. Th\u00e9orie Nombres Bordeaux 13, 371\u2013394 (2001)","journal-title":"J. Th\u00e9orie Nombres Bordeaux"},{"key":"15_CR10","unstructured":"Christou, M., Crochemore, M., Iliopoulos, C.S.: Quasiperiodicities in Fibonacci strings (2012), to appear in Ars Combinatoria. Preprint available at http:\/\/arxiv.org\/abs\/1201.6162"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Syst. Theory 6, 164\u2013192 (1972)","journal-title":"Math. Syst. Theory"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255, 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR13","unstructured":"Du, C.F., Mousavi, H., Schaeffer, L., Shallit, J.: Decision algorithms for Fibonacci-automatic words, with applications to pattern avoidance (2014). http:\/\/arxiv.org\/abs\/1406.0670"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1051\/ita:2007039","volume":"42","author":"E Duch\u00eane","year":"2008","unstructured":"Duch\u00eane, E., Rigo, M.: A morphic approach to combinatorial games: theTribonacci case. RAIRO Inform. Th\u00e9or. App. 42, 375\u2013393 (2008)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01368783","volume":"25","author":"C Frougny","year":"1992","unstructured":"Frougny, C.: Representations of numbers and finite automata. Math. Systems Theory 25, 37\u201360 (1992)","journal-title":"Math. Systems Theory"},{"key":"15_CR16","series-title":"London Mathematical Society Lecture Note Series","first-page":"345","volume-title":"Ergodic Theory of $${\\mathbb{Z}}^d$$ Actions (Warwick, 1993\u20131994)","author":"C Frougny","year":"1996","unstructured":"Frougny, C., Solomyak, B.: On representation of integers in linear numeration systems. In: Pollicott, M., Schmidt, K. (eds.) Ergodic Theory of $${\\mathbb{Z}}^d$$ Actions (Warwick, 1993\u20131994). London Mathematical Society Lecture Note Series, vol. 228, pp. 345\u2013368. Cambridge University Press, Cambridge (1996)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Glen, A.: On sturmian and episturmian words, and related topics. Ph.D. thesis, University of Adelaide (2006)","DOI":"10.1017\/S0004972700047559"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.tcs.2007.03.023","volume":"380","author":"A Glen","year":"2007","unstructured":"Glen, A.: Powers in a class of $$a$$-strict episturmian words. Theoret. Comput. Sci. 380, 330\u2013354 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR19","first-page":"402","volume":"43","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J.: Episturmian words: a survey. RAIRO Inform. Th\u00e9or. App. 43, 402\u2013433 (2009)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.tcs.2008.09.056","volume":"409","author":"A Glen","year":"2008","unstructured":"Glen, A., Lev\u00e9, F., Richomme, G.: Quasiperiodic and Lyndon episturmian words. Theoret. Comput. Sci. 409, 578\u2013600 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-31606-7_16","volume-title":"Implementation and Application of Automata","author":"D Go\u010d","year":"2012","unstructured":"Go\u010d, D., Henshall, D., Shallit, J.: Automatic theorem-proving in combinatorics on words. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 180\u2013191. Springer, Heidelberg (2012)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-37064-9_27","volume-title":"Language and Automata Theory and Applications","author":"D Go\u010d","year":"2013","unstructured":"Go\u010d, D., Mousavi, H., Shallit, J.: On the number of unbordered factors. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 299\u2013310. Springer, Heidelberg (2013)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-37064-9_28","volume-title":"Language and Automata Theory and Applications","author":"D Go\u010d","year":"2013","unstructured":"Go\u010d, D., Saari, K., Shallit, J.: Primitive words and Lyndon words in automatic and linearly recurrent sequences. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 311\u2013322. Springer, Heidelberg (2013)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-38771-5_23","volume-title":"Developments in Language Theory","author":"D Go\u010d","year":"2013","unstructured":"Go\u010d, D., Schaeffer, L., Shallit, J.: Subword complexity and k-synchronization. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 252\u2013263. Springer, Heidelberg (2013)"},{"issue":"11","key":"15_CR25","first-page":"1370","volume":"55","author":"TC Hales","year":"2008","unstructured":"Hales, T.C.: Formal proof. Notices Am. Math. Soc. 55(11), 1370\u20131380 (2008)","journal-title":"Notices Am. Math. Soc."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(01)00207-9","volume":"276","author":"J Justin","year":"2002","unstructured":"Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoret. Comput. Sci. 276, 281\u2013313 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Konev, B., Lisitsa, A.: A SAT attack on the Erd\u0151s discrepancy problem (2014). Preprint available at http:\/\/arxiv.org\/abs\/1402.2184","DOI":"10.1007\/978-3-319-09284-3_17"},{"key":"15_CR28","unstructured":"Presburger, M.: \u00dcber die Volst\u00e4ndigkeit eines gewissen Systems derArithmetik ganzer Zahlen, in welchem die Addition als einzigeOperation hervortritt. In: Sparawozdanie z I Kongresu matematyk\u00f3wkraj\u00f3w slowianskich, Warsaw, pp.\u00a092\u2013101, 395 (1929)"},{"key":"15_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/014453409108837187","volume":"12","author":"M Presburger","year":"1991","unstructured":"Presburger, M.: On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation. Hist. Phil. Logic 12, 225\u2013233 (1991)","journal-title":"Hist. Phil. Logic"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.aam.2010.01.006","volume":"45","author":"G Richomme","year":"2010","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45, 212\u2013231 (2010)","journal-title":"Adv. Appl. Math."},{"key":"15_CR31","unstructured":"Rosema, S.W., Tijdeman, R.: The Tribonacci substitution. INTEGERS 5 (3), Paper #A13 (2005). Available at http:\/\/www.integers-ejcnt.org\/vol5-3.html"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-38536-0_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Shallit","year":"2013","unstructured":"Shallit, J.: Decidability and enumeration for automatic sequences: a survey. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 49\u201363. Springer, Heidelberg (2013)"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1016\/j.ejc.2006.07.007","volume":"28","author":"B Tan","year":"2007","unstructured":"Tan, B., Wen, Z.Y.: Some properties of the Tribonacci sequence. Eur. J. Comb. 28, 1703\u20131719 (2007)","journal-title":"Eur. J. Comb."},{"key":"15_CR34","unstructured":"Turek, O.: Abelian complexity function of the Tribonacci word. J. Integer Sequences 18, Article 15.3.4 (2015). Available at https:\/\/cs.uwaterloo.ca\/journals\/JIS\/VOL18\/Turek\/turek3.html"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23660-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:18:32Z","timestamp":1676967512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_15","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":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}