{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:40Z","timestamp":1725491440342},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_36","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"382-398","source":"Crossref","is-referenced-by-count":7,"title":["Suffix Automata and Standard Sturmian Words"],"prefix":"10.1007","author":[{"given":"Marinella","family":"Sciortino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Q.","family":"Zamboni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","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., S\u00e9\u00e9bold, P.: Sturmian words. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a090, ch. 2, pp. 45\u2013110. Cambridge University Press, Cambridge (2002)"},{"key":"36_CR2","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., Ehrenfeucht, A., Haussler, D., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subword of a text. Theoret. Comput. Sci.\u00a0(40), 31\u201355 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR3","first-page":"12","volume":"21","author":"A. Blumer","year":"1983","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., McConnell, R.: Linear size finite automata for the set of all subwords of a word: An outline of results. Bull. Eur. Assoc. Theoret. Comput. Sci.\u00a0(21), 12\u201320 (1983)","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(99)00334-5","volume":"259","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Words and special factors. Theoret. Comput. Sci.\u00a0(259), 145\u2013182 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"Crochemore, M.: Transducers and repetions. Theoret. Compu. Sci.\u00a045, 63\u201386 (1986)","journal-title":"Theoret. Compu. Sci."},{"key":"36_CR6","first-page":"106","volume-title":"Applied Combinatorics on Words","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M.: Structures for indexes. In: Lothaire, M. (ed.) Applied Combinatorics on Words, ch. 2, pp. 106\u2013163. Cambridge University Press, Cambridge (2005)"},{"key":"36_CR7","series-title":"Linear Modeling: Background and Application","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-3-662-07675-0_9","volume-title":"Handbook of Formal Languages","author":"M. Crochemore","year":"1997","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Linear Modeling: Background and Application, vol.\u00a02, ch. 9, pp. 399\u2013462. Springer, Heidelberg (1997)"},{"key":"36_CR8","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":"36_CR9","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.\u00a0(136), 361\u2013385 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proc. Am. Mathematical Society\u00a0(16), 109\u2013114 (1965)","journal-title":"Proc. Am. Mathematical Society"},{"key":"36_CR12","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. Informat. Proc. Lett.\u00a086, 241\u2013246 (2003)","journal-title":"Informat. Proc. Lett."},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90046-7","volume":"65","author":"F. Mignosi","year":"1989","unstructured":"Mignosi, F.: Infinite words with linear subword complexity. Theoret. Comput. Sci.\u00a0(65), 221\u2013242 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR15","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.\u00a0(62), 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"unstructured":"Ukkonen, E.: Constructing suffix trees online in linear time. In: Proceedings of the IFIP 12th World Computer Congress, pp. 484\u2013492 (1992)","key":"36_CR16"},{"doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory","key":"36_CR17","DOI":"10.1109\/SWAT.1973.13"}],"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_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:36Z","timestamp":1619517936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}