{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:13Z","timestamp":1725545053178},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_21","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T10:07:40Z","timestamp":1141207660000},"page":"250-261","source":"Crossref","is-referenced-by-count":2,"title":["The Structure of Subword Graphs and Suffix Trees of Fibonacci Words"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Rytter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Jewels of stringology: text algorithms","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology: text algorithms. World Scientific, Singapore (2003)"},{"key":"21_CR2","volume-title":"Computing Patterns in Strings","author":"W. Smyth","year":"2003","unstructured":"Smyth, W.: Computing Patterns in Strings. Addison-Wesley, Reading (2003)"},{"key":"21_CR3","first-page":"179","volume":"41","author":"E. Zeckendorff","year":"1972","unstructured":"Zeckendorff, E.: Repr\u00e9sentation des nombres naturels par une somme des nombres de fibonacci ou de nombres de lucas. Bulletin de la Soci\u00e9t\u00e9 Royale des Sciences de Li\u00e8ge\u00a041, 179\u2013182 (1972)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Royale des Sciences de Li\u00e8ge"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"D.M. Costas Iliopoulos","year":"1997","unstructured":"Costas Iliopoulos, D.M., Smyth, W.: A characterization of the squares in a fibonacci string. Theor. Comput. Sci.\u00a0172, 281\u2013291 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","unstructured":"Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. King\u2019s College London Publications (2004)"},{"key":"21_CR6","first-page":"315","volume":"36","author":"T. Harju","year":"2002","unstructured":"Harju, T., Nowotka, D.: Density of critical factorizations. ITA\u00a036, 315\u2013327 (2002)","journal-title":"ITA"},{"key":"21_CR7","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhumaki, J.: Combinatorics on words \u2013 a tutorial. Bulletin of the EATCS\u00a079, 178\u2013228 (2003)","journal-title":"Bulletin of the EATCS"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"F. Mignosi","year":"1992","unstructured":"Mignosi, F., Pirillo, G.: Repetitions in the fibonacci infinite word. RAIRO Inform. Theor. Appl.\u00a026, 199\u2013204 (1992)","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"21_CR9","first-page":"596","volume-title":"FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 596. IEEE Computer Society, Washington, DC, USA (1999)"},{"key":"21_CR10","unstructured":"Mikulski, \u0141.: Personal communication (2005)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-30550-7_15","volume-title":"Developments in Language Theory","author":"C. Epifanio","year":"2004","unstructured":"Epifanio, C., Mignosi, F., Shallit, J., Venturini, I.: Sturmian graphs and a conjecture of moser. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 175\u2013187. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:17Z","timestamp":1619492717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11605157_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}