{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:31Z","timestamp":1725516031724},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708438"},{"type":"electronic","value":"9783540708445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70844-5_26","type":"book-chapter","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T09:19:29Z","timestamp":1216718369000},"page":"252-261","source":"Crossref","is-referenced-by-count":5,"title":["The Number of Runs in Sturmian Words"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Baturo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Baturo, P., Rytter, W.: Occurrence and lexicographic properties of standard Sturmian words. In: LATA 2007 (2007)"},{"key":"26_CR2","series-title":"Encyclopedia of Mathematics and its Applications","first-page":"45","volume-title":"Algebraic combinatorics on words","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Seebold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, ch.2, vol.\u00a090, pp. 45\u2013110. Cambridge University Press, Cambridge (2002)"},{"key":"26_CR3","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words - a tutorial. Bull. EATCS\u00a079, 178\u2013228 (2003)","journal-title":"Bull. EATCS"},{"issue":"1-2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C. Iliopoulos","year":"1997","unstructured":"Iliopoulos, C., Moore, D., Smyth, W.F.: Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci.\u00a0172(1-2), 281\u2013291 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-74456-6_42","volume-title":"Mathematical Foundations of Computer Science 2007","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Ilie, L.: Analysis of Maximal Repetitions in Strings. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 465\u2013476. Springer, Heidelberg (2007)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Ilie, L., Tinta, I.: Towards a solution to the \u201druns\u201d conjecture (to be published, CPM 2008)","DOI":"10.1007\/978-3-540-69068-9_27"},{"key":"26_CR7","unstructured":"Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: Miller, M., Park, K. (eds.) Proceeding of 14th Australian Workshop on Combinatorial Algorithms, pp. 26\u201335 (2003)"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(00)00063-3","volume":"249","author":"F. Franek","year":"2000","unstructured":"Franek, F., Karaman, A., Smyth, W.F.: Repetitions in Sturmian strings. Theoretical Computer Science\u00a0249(2), 289\u2013303 (2000)","journal-title":"Theoretical Computer Science"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-48321-7_31","volume-title":"Fundamentals of Computation Theory","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: On Maximal Repetitions in Words. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 374\u2013385. Springer, Heidelberg (1999)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding Maximal Repetitions in a Word in Linear Time. In: FOCS 1999, pp. 596\u2013604 (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"issue":"9","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ic.2007.01.007","volume":"205","author":"W. Rytter","year":"2007","unstructured":"Rytter, W.: The number of runs in a string. Information and Computation\u00a0205(9), 1459\u20131469 (2007)","journal-title":"Information and Computation"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-540-27836-8_5","volume-title":"Automata, Languages and Programming","author":"W. Rytter","year":"2004","unstructured":"Rytter, W.: Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 15\u201327. Springer, Heidelberg (2004)"},{"issue":"2","key":"26_CR13","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. Theoretical Computer Science\u00a0363(2), 211\u2013223 (2006)","journal-title":"Theoretical Computer Science"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-73208-2_36","volume-title":"Developments in Language Theory","author":"M. Sciortino","year":"2007","unstructured":"Sciortino, M., Zamboni, L.: Suffix Automata and Standard Sturmian Words. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 382\u2013398. Springer, Heidelberg (2007)"},{"key":"26_CR15","volume-title":"Computing patterns in strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing patterns in strings. Addison Wesley, Reading (2003)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Applications of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70844-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:30:14Z","timestamp":1620016214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70844-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708438","9783540708445"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70844-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}