{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:53Z","timestamp":1725491453544},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"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-73208-2_35","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"371-381","source":"Crossref","is-referenced-by-count":2,"title":["A Local Balance Property of Episturmian Words"],"prefix":"10.1007","author":[{"given":"Gw\u00e9na\u00ebl","family":"Richomme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic sequences","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic sequences. Cambridge University Press, Cambridge (2003)"},{"key":"35_CR2","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\u00e9s 2n\u2009+\u20091. Bull. Soc. Math. France\u00a0119, 199\u2013215 (1991)","journal-title":"Bull. Soc. Math. France"},{"unstructured":"Berstel, J., S\u00e9\u00e9bold, P.: Algebraic Combinatorics on Words. In: Lothaire, M. (ed.) Sturmian words, vol.\u00a090, ch. 2, Cambridge Mathematical Library (2002)","key":"35_CR3"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.4064\/aa122-4-1","volume":"122","author":"V. Berth\u00e9","year":"2006","unstructured":"Berth\u00e9, V., Holton, C., Zamboni, L.Q.: Initial powers of sturmian sequences. Acta. arithmetica\u00a0122, 315\u2013347 (2006)","journal-title":"Acta arithmetica"},{"key":"35_CR5","first-page":"67","volume":"4","author":"J. Cassaigne","year":"1997","unstructured":"Cassaigne, J.: Complexit\u00e9 et facteurs sp\u00e9ciaux. Belg. Bull. Math. Soc.\u00a04, 67\u201388 (1997)","journal-title":"Belg. Bull. Math. Soc."},{"issue":"4","key":"35_CR6","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":"35_CR7","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. Syst. Th.\u00a07, 138\u2013153 (1973)","journal-title":"Math. Syst. Th."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(96)00054-0","volume":"178","author":"A. Luca de","year":"1997","unstructured":"de Luca, A.: On standard Sturmian morphisms. Theoretical Computer Science\u00a0178, 205\u2013224 (1997)","journal-title":"Theoretical Computer Science"},{"key":"35_CR9","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. Theoretical Computer Science\u00a0255, 539\u2013553 (2001)","journal-title":"Theoretical Computer Science"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0304-3975(90)90050-R","volume":"71","author":"S. Dulucq","year":"1990","unstructured":"Dulucq, S., Gouyou-Beauchamps, D.: Sur les facteurs des suites de Sturm. Theoretical Computer Science\u00a071, 381\u2013400 (1990)","journal-title":"Theoretical Computer Science"},{"key":"35_CR11","first-page":"9","volume-title":"International School and Conference on Combinatorics, Automata and Number Theory (Cant 2006)","author":"A. Glen","year":"2006","unstructured":"Glen, A.: A characterization of fine words over a finite alphabet. In: International School and Conference on Combinatorics, Automata and Number Theory (Cant 2006), p. 9. Universit\u00e9 de Li\u00e8ge, Belgium (2006)"},{"unstructured":"Glen, A., Justin, J., Pirillo, G.: Characterizations of finite and infinite episturmian words via lexicographic orderings (submitted, 2006)","key":"35_CR12"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(98)00202-3","volume":"242","author":"P. Hubert","year":"2000","unstructured":"Hubert, P.: Suites \u00e9quilibr\u00e9es. Theoretical Computer Science\u00a0242, 91\u2013108 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"35_CR14","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. Theoretical Computer Science\u00a0276(1-2), 281\u2013313 (2002)","journal-title":"Theoretical Computer Science"},{"key":"35_CR15","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. RAIRO Theoret. Infor. Appl.\u00a034, 343\u2013356 (2000)","journal-title":"RAIRO Theoret. Infor. Appl."},{"key":"35_CR16","first-page":"128","volume":"84","author":"F. Lev\u00e9","year":"2004","unstructured":"Lev\u00e9, F., Richomme, G.: Quasiperiodic infinite words: some answers. Bull. Europ. Assoc. Theoret. Comput. Sci.\u00a084, 128\u2013238 (2004)","journal-title":"Bull. Europ. Assoc. Theoret. Comput. Sci."},{"issue":"1","key":"35_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2006.10.034","volume":"372","author":"F. Lev\u00e9","year":"2007","unstructured":"Lev\u00e9, F., Richomme, G.: Quasiperiodic Sturmian words and morphisms. Theoretical Computer Science\u00a0372(1), 15\u201325 (2007)","journal-title":"Theoretical Computer Science"},{"key":"35_CR18","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on words. Encyclopedia of Mathematics and its Applications, vol.\u00a017. Addison-Wesley, London (1997) Reprinted in the Cambridge Mathematical Library, Cambridge University Press, UK, 1997"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"61","author":"M. Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.A.: Symbolic Dynamics II: Sturmian trajectories. Amer. J. Math.\u00a061, 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Frontiers of Combining Systems","author":"N. Pytheas Fogg","year":"2000","unstructured":"Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. In: Berth\u00e9, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.) Frontiers of Combining Systems. LNCS, vol.\u00a01794, Springer, Heidelberg (2000)"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00726-0","volume":"302","author":"G. Richomme","year":"2003","unstructured":"Richomme, G.: Conjugacy and episturmian morphisms. Theoretical Computer Science\u00a0302, 1\u201334 (2003)","journal-title":"Theoretical Computer Science"},{"unstructured":"Richomme, G.: Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theoretical Computer Science (Words 2005 special number) (to appear)","key":"35_CR22"},{"issue":"5","key":"35_CR23","doi-asserted-by":"crossref","first-page":"787","DOI":"10.36045\/bbms\/1074791332","volume":"10","author":"L. Vuillon","year":"2003","unstructured":"Vuillon, L.: Balanced words. Bull. Belg. Math.Soc.\u00a010(5), 787\u2013805 (2003)","journal-title":"Bull. Belg. Math.Soc."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T13:13:20Z","timestamp":1587906800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}