{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:01:02Z","timestamp":1772290862950,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":70,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540754138","type":"print"},{"value":"9783540754145","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75414-5_2","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"23-47","source":"Crossref","is-referenced-by-count":23,"title":["Sturmian and Episturmian Words"],"prefix":"10.1007","author":[{"given":"Jean","family":"Berstel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.dam.2002.12.001","volume":"139","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital straightness\u2014a review. Discrete Appl. Math.\u00a0139, 197\u2013230 (2004)","journal-title":"Discrete Appl. Math."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"M. Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics II. Sturmian trajectories. Amer. J. Math.\u00a062, 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-70918-3_7","volume-title":"STACS 2007","author":"J. Berstel","year":"2007","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: A first investigation of Sturmian trees. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 73\u201384. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"2_CR4","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(1-3), 282\u2013300 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR5","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.: Epi-Sturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci.\u00a0255(1-2), 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1051\/ita:2003005","volume":"36","author":"J. Justin","year":"2002","unstructured":"Justin, J., Pirillo, G.: On a characteristic property of Arnoux-Rauzy sequences. Theor. Inform. Appl.\u00a036(4), 385\u2013388 (2002)","journal-title":"Theor. Inform. Appl."},{"issue":"1-2","key":"2_CR7","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.\u00a0276(1-2), 281\u2013313 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/978-88-470-2107-5_23","volume-title":"Algebraic Combinatorics and Computer Science","author":"J. Justin","year":"2001","unstructured":"Justin, J.: Episturmian words and morphisms (results and conjectures). In: Crapo, H., Senato, D. (eds.) Algebraic Combinatorics and Computer Science, pp. 533\u2013539. Springer, Heidelberg (2001)"},{"key":"2_CR9","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\u00e9om\u00e9trique de suites de complexit\u00e9 2n\u2009+\u20091. Bull. Soc. Math. France\u00a0119, 199\u2013215 (1991)","journal-title":"Bull. Soc. Math. France"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01762232","volume":"7","author":"E.M. Coven","year":"1973","unstructured":"Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Systems Theory\u00a07, 138\u2013153 (1973)","journal-title":"Math. Systems Theory"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J.P. Allouche","year":"2003","unstructured":"Allouche, J.P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoret. Comput. Sci.\u00a0292(1), 9\u201331 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.tcs.2007.03.019","volume":"380","author":"P. Bal\u00e1\u017ei","year":"2007","unstructured":"Bal\u00e1\u017ei, P., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E.: Factor versus palindromic complexity of uniformly recurrent infinite words. Theoret. Comput. Sci.\u00a0380, 266\u2013275 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(97)00188-6","volume":"223","author":"X. Droubay","year":"1999","unstructured":"Droubay, X., Pirillo, G.: Palindromes and Sturmian words. Theoret. Comput. Sci.\u00a0223(1-2), 73\u201385 (1999)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"2_CR14","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1142\/S0129055X03001758","volume":"15","author":"D. Damanik","year":"2003","unstructured":"Damanik, D., Zamboni, L.Q.: Combinatorial properties of Arnoux-Rauzy subshifts and applications to Schr\u00f6dinger operators. Rev. Math. Phys.\u00a015(7), 745\u2013763 (2003)","journal-title":"Rev. Math. Phys."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/9789812704979_0004","volume-title":"Words, Languages and Combinatorics","author":"S.V. Avgustinovich","year":"2003","unstructured":"Avgustinovich, S.V., Fon-Der-Flaas, D.G., Frid, A.E.: Arithmetical complexity of infinite words. In: Words, Languages and Combinatorics. Proc. 3rd Conf. Words, Languages and Combinatorics, Kyoto, March 2000, vol.\u00a0III, pp. 51\u201362. World Scientific, Singapore (2003)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.tcs.2007.03.022","volume":"380","author":"J. Cassaigne","year":"2007","unstructured":"Cassaigne, J., Frid, A.E.: On the arithmetical complexity of Sturmian words. Theoret. Comput. Sci.\u00a0380, 304\u2013316 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1051\/ita:2006041","volume":"40","author":"S.V. Avgustinovich","year":"2006","unstructured":"Avgustinovich, S.V., Cassaigne, J., Frid, A.E.: Sequences of low arithmetical complexity. Theor. Inform. Appl.\u00a040(4), 569\u2013582 (2006)","journal-title":"Theor. Inform. Appl."},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1017\/S0143385702000585","volume":"22","author":"T. Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.Q.: Maximal pattern complexity for discrete systems. Ergodic Theory Dynam. Systems\u00a022(4), 1201\u20131214 (2002)","journal-title":"Ergodic Theory Dynam. Systems"},{"issue":"15","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1016\/j.disc.2006.03.043","volume":"306","author":"T. Kamae","year":"2006","unstructured":"Kamae, T., Rao, H., Tan, B., Xue, Y.M.: Language structure of pattern Sturmian words. Discrete Math.\u00a0306(15), 1651\u20131668 (2006)","journal-title":"Discrete Math."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ejc.2004.07.006","volume":"27","author":"T. Kamae","year":"2006","unstructured":"Kamae, T., Rao, H.: Maximal pattern complexity of words over l letters. European J. Combin.\u00a027(1), 125\u2013137 (2006)","journal-title":"European J. Combin."},{"issue":"3","key":"2_CR21","doi-asserted-by":"crossref","first-page":"26","DOI":"10.3792\/pjaa.75.26","volume":"75","author":"I. Nakashima","year":"1999","unstructured":"Nakashima, I., Tamura, J.I., Yasutomi, S.I.: Modified complexity and \u2217-Sturmian word. Proc. Japan Acad. Ser. A Math. Sci.\u00a075(3), 26\u201328 (1999)","journal-title":"Proc. Japan Acad. Ser. A Math. Sci."},{"issue":"3","key":"2_CR22","doi-asserted-by":"crossref","first-page":"767","DOI":"10.5802\/jtnb.426","volume":"15","author":"I. Nakashima","year":"2003","unstructured":"Nakashima, I., Tamura, J.I., Yasutomi, S.I.: *-Sturmian words and complexity. J. Theor. Nombres Bordeaux\u00a015(3), 767\u2013804 (2003)","journal-title":"J. Theor. Nombres Bordeaux"},{"issue":"1","key":"2_CR23","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(1), 45\u201382 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR24","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: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 249\u2013267. Springer, Heidelberg (1997)"},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.4064\/aa-95-2-167-184","volume":"95","author":"R. Risley","year":"2000","unstructured":"Risley, R., Zamboni, L.Q.: A generalization of Sturmian sequences: combinatorial structure and transcendence. Acta Arith.\u00a095, 167\u2013184 (2000)","journal-title":"Acta Arith."},{"key":"2_CR26","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 ${\\cal a}$ -strict standard episturmian words. Theoret. Comput. Sci.\u00a0380, 330\u2013354 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Tan, B., Wen, Z.Y.: Some properties of the Tribonacci sequence. European J. Combin. (2007)","DOI":"10.1016\/j.ejc.2006.07.007"},{"issue":"2","key":"2_CR28","doi-asserted-by":"crossref","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. Theor. Nombres Bordeaux\u00a013(2), 371\u2013394 (2001)","journal-title":"J. Theor. Nombres Bordeaux"},{"key":"2_CR29","series-title":"Encyclopedia of Mathematics and its Applications","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. Encyclopedia of Mathematics and its Applications, vol.\u00a0105. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"2_CR30","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF03025802","volume":"7","author":"C. Series","year":"1985","unstructured":"Series, C.: The geometry of Markoff numbers. Math. Intelligencer\u00a07(3), 20\u201329 (1985)","journal-title":"Math. Intelligencer"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., Ei, H., Ito, S., Rao, H.: Invertible substitutions and Sturmian words: an application to Rauzy fractals. Theor. Inform. Appl. (to appear, 2007)","DOI":"10.1051\/ita:2007026"},{"key":"2_CR32","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Pytheas Fogg, N.: Substitutions in dynamics, arithmetics and combinatorics. In: Berth\u00e9, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.) Lecture Notes in Mathematics, vol.\u00a01794, Springer, Heidelberg (2002)","DOI":"10.1007\/b13861"},{"key":"2_CR34","first-page":"145","volume":"6","author":"E.B. Christoffel","year":"1875","unstructured":"Christoffel, E.B.: Observatio arithmetica. Annali di Mathematica\u00a06, 145\u2013152 (1875)","journal-title":"Annali di Mathematica"},{"key":"2_CR35","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/978-88-470-2107-5_24","volume-title":"Algebraic Combinatorics and Computer Science. A tribute to Gian-Carlo Rota","author":"G. Pirillo","year":"2001","unstructured":"Pirillo, G.: A curious characteristic property of standard Sturmian words. In: Crapo, H., Senato, D. (eds.) Algebraic Combinatorics and Computer Science. A tribute to Gian-Carlo Rota, pp. 541\u2013546. Springer, Heidelberg (2001)"},{"issue":"2","key":"2_CR36","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. Theoret. Comput. Sci.\u00a0136(2), 361\u2013385 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR37","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.tcs.2005.03.036","volume":"340","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."},{"issue":"3","key":"2_CR38","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0129054106003991","volume":"17","author":"A. Luca de","year":"2006","unstructured":"de Luca, A., De Luca, A.: Combinatorial properties of Sturmian palindromes. Internat. J. Found. Comput. Sci.\u00a017(3), 557\u2013573 (2006)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.tcs.2005.03.021","volume":"340","author":"A. Carpi","year":"2005","unstructured":"Carpi, A., de Luca, A.: Codes of central Sturmian words. Theoret. Comput. Sci.\u00a0340(2), 220\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR40","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(1-2), 171\u2013203 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR41","unstructured":"Berth\u00e9, V., de Luca, A., Reutenauer, C.: On an involution of Christoffel words and Sturmian morphisms. In: European J. Combinatorics (in press, 2007)"},{"issue":"1-3","key":"2_CR42","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(03)00398-0","volume":"310","author":"W.F. Chuan","year":"2004","unstructured":"Chuan, W.F.: Moments of conjugacy classes of binary words. Theoret. Comput. Sci.\u00a0310(1-3), 273\u2013285 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-3","key":"2_CR43","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(03)00397-9","volume":"310","author":"O. Jenkinson","year":"2004","unstructured":"Jenkinson, O., Zamboni, L.Q.: Characterisations of balanced words via orderings. Theoret. Comput. Sci.\u00a0310(1-3), 247\u2013271 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"2_CR44","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2006.01.036","volume":"356","author":"A. Luca de","year":"2006","unstructured":"de Luca, A., De Luca, A.: Some characterizations of finite Sturmian words. Theoret. Comput. Sci.\u00a0356(1-2), 118\u2013125 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(01)00247-5","volume":"121","author":"I. Fagnot","year":"2002","unstructured":"Fagnot, I., Vuillon, L.: Generalized balances in Sturmian words. Discrete Appl. Math.\u00a0121(1-3), 83\u2013101 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"2_CR46","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.5802\/aif.1792","volume":"50","author":"J. Cassaigne","year":"2000","unstructured":"Cassaigne, J., Ferenczi, S., Zamboni, L.Q.: Imbalances in Arnoux-Rauzy sequences. Ann. Inst. Fourier (Grenoble)\u00a050(4), 1265\u20131276 (2000)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"2_CR47","first-page":"67","volume":"39","author":"E.P. Lipatov","year":"1982","unstructured":"Lipatov, E.P.: A classification of binary collections and properties of homogeneity classes. Problemy Kibernet\u00a039, 67\u201384 (1982)","journal-title":"Problemy Kibernet"},{"issue":"1","key":"2_CR48","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90172-X","volume":"82","author":"F. Mignosi","year":"1991","unstructured":"Mignosi, F.: On the number of factors of Sturmian words. Theoret. Comput. Sci.\u00a082(1), 71\u201384 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0218196793000238","volume":"3","author":"J. Berstel","year":"1993","unstructured":"Berstel, J., Pocchiola, M.: A geometric proof of the enumeration formula for Sturmian words. Internat. J. Algebra Comput.\u00a03(3), 349\u2013355 (1993)","journal-title":"Internat. J. Algebra Comput."},{"key":"2_CR50","unstructured":"Berstel, J., Pocchiola, M.: Random generation of finite Sturmian words. In: Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics (Florence, 1993), vol.\u00a0153, pp. 29\u201339 (1996)"},{"issue":"6","key":"2_CR51","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/34.9109","volume":"10","author":"C.A. Berenstein","year":"1988","unstructured":"Berenstein, C.A., Lavine, D.: On the number of digital straight line segments. IEEE Trans. Pattern Anal. Mach. Intell.\u00a010(6), 880\u2013887 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/18.50392","volume":"36","author":"J. Koplowitz","year":"1990","unstructured":"Koplowitz, J., Lindenbaum, M., Bruckstein, A.M.: The number of digital straight lines on an n\u00d7n grid. IEEE Transactions on Information Theory\u00a036(1), 192\u2013197 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2_CR53","doi-asserted-by":"crossref","first-page":"421","DOI":"10.5802\/jtnb.331","volume":"13","author":"A. Heinis","year":"2001","unstructured":"Heinis, A.: On low-complexity bi-infinite words and their factors. J. Theor. Nombres Bordeaux\u00a013(2), 421\u2013442 (2001)","journal-title":"J. Theor. Nombres Bordeaux"},{"key":"2_CR54","unstructured":"Tarannikov, Y.: On the bounds for the number of \u2113-balanced words. Technical report, Mech. & Math. Department, Moscow State University (2007)"},{"issue":"2","key":"2_CR55","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4064\/aa101-2-4","volume":"101","author":"F. Mignosi","year":"2002","unstructured":"Mignosi, F., Zamboni, L.Q.: On the number of Arnoux-Rauzy words. Boolean Calculus of Differences\u00a0101(2), 121\u2013129 (2002)","journal-title":"Acta Arith."},{"issue":"1","key":"2_CR56","doi-asserted-by":"crossref","first-page":"12","DOI":"10.37236\/951","volume":"14","author":"G. Paquin","year":"2007","unstructured":"Paquin, G., Vuillon, L.: A characterization of balanced episturmian sequences. Electronic J. Combinatorics\u00a014(1) R33, pages 12 (2007)","journal-title":"Electronic J. Combinatorics"},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Glen, A., Justin, J., Pirillo, G.: Characterizations of finite and infinite episturmian words via lexicographic orderings. European Journal of Combinatorics (2007)","DOI":"10.1016\/j.ejc.2007.01.002"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Pirillo, G.: Morse and Hedlund\u2019s skew Sturmian words revisited. Annals Combinatorics\u00a0 (to appear, 2007)","DOI":"10.1007\/s00026-008-0340-7"},{"key":"2_CR59","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1090\/S0002-9939-00-05950-5","volume":"129","author":"S. Gan","year":"2001","unstructured":"Gan, S.: Sturmian sequences and the lexicographic world. Proc. Amer. Math. Soc. (electronic)\u00a0129, 1445\u20131451 (2001)","journal-title":"Proc. Amer. Math. Soc. (electronic)"},{"key":"2_CR60","unstructured":"Glen, A.: A characterization of fine words over a finite alphabet. Theoret. Comput. Sci. CANT conference, Liege, Belgium, May 8-19, 2007, 8\u201319 (to appear, 2007)"},{"key":"2_CR61","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.tcs.2005.04.008","volume":"341","author":"G. Pirillo","year":"2005","unstructured":"Pirillo, G.: Inequalities characterizing standard Sturmian and episturmian words. Theoret. Comput. Sci.\u00a0341, 276\u2013292 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR62","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, Digital System Research Center (1994)"},{"key":"2_CR63","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"I. Gessel","year":"1993","unstructured":"Gessel, I., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Comb. Theory A\u00a064, 189\u2013215 (1993)","journal-title":"J. Comb. Theory A"},{"key":"2_CR64","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2004.11.014","volume":"332","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theoret. Comput. Sci.\u00a0332, 567\u2013572 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR65","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S. Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows Wheeler transform and Sturmian words. Inform. Proc. Letters\u00a086, 241\u2013246 (2003)","journal-title":"Inform. Proc. Letters"},{"key":"2_CR66","doi-asserted-by":"crossref","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows Wheeler transform. Theoret. Comput. Sci. (2007)","DOI":"10.1016\/j.tcs.2007.07.014"},{"issue":"2","key":"2_CR67","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2006.07.025","volume":"363","author":"W. Rytter","year":"2006","unstructured":"Rytter, W.: The structure of subword graphs and suffix trees of Fibonacci words. Theoret. Comput. Sci.\u00a0363(2), 211\u2013223 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.dam.2006.11.003","volume":"155","author":"C. Epifanio","year":"2007","unstructured":"Epifanio, C., Mignosi, F., Shallit, J., Venturini, I.: On Sturmian graphs. Discrete Appl. Math\u00a0155, 1014\u20131030 (2007)","journal-title":"Discrete Appl. Math"},{"issue":"1","key":"2_CR69","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J.A., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text (Special issue: Eleventh international colloquium on automata, languages and programming (Antwerp, 1984)). Theoret. Comput. Sci.\u00a040(1), 31\u201355 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR70","volume-title":"Jewels of stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific Publishing Co. Inc, River Edge, NJ (2003)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:12:17Z","timestamp":1630282337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_2"}},"subtitle":["(A Survey of Some Recent Results)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540754138","9783540754145"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}