{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:09Z","timestamp":1725558969832},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_15","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:06:05Z","timestamp":1278083165000},"page":"175-187","source":"Crossref","is-referenced-by-count":3,"title":["Sturmian Graphs and a Conjecture of Moser"],"prefix":"10.1007","author":[{"given":"Chiara","family":"Epifanio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Venturini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","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., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science\u00a040(1), 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"Journal of the ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(92)90270-K","volume":"24","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Haussler, D., Ehrenfeucht, A.: Average sizes of suffix trees and dawgs. Discrete Applied Mathematics\u00a024, 37\u201345 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01937326","volume":"23","author":"I. Borosh","year":"1983","unstructured":"Borosh, I., Niederreiter, H.: Optimal multipliers for pseudo-random number generation by the linear congruential method. BIT\u00a023, 65\u201374 (1983)","journal-title":"BIT"},{"key":"15_CR5","series-title":"Springer Series in Computational Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58169-4","volume-title":"History of continued fractions and Pad\u00e9 approximants","author":"C. Brezinski","year":"1991","unstructured":"Brezinski, C.: History of continued fractions and Pad\u00e9 approximants. Springer Series in Computational Mathematics, vol.\u00a012. Springer-Verlag, Heidelberg (1991)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(01)00222-5","volume":"292","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M.: Reducing space for index implementation. Theoretical Computer Science\u00a0292(1), 185\u2013197 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"1997","unstructured":"Crochemore, M., V\u00e9rin, R.: Direct Construction of Compact Directed Acyclic Word Graphs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, Springer, Heidelberg (1997)"},{"key":"15_CR8","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. TCS\u00a0136, 361\u2013385 (1994)","journal-title":"TCS"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Epifanio, C., Mignosi, F., Shallit, J., Venturini, I.: Sturmian Graphs and a Conjecture of Moser. Technical Report 262, Dip. Mat. ed Appl., Universit\u00e0 di Palermo. (2004), Available at \n                    \n                      http:\/\/math.unipa.it\/~mignosi","DOI":"10.1007\/978-3-540-30550-7_15"},{"key":"15_CR10","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1989","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1989)","edition":"5"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44977-9_31","volume-title":"Implementation and Application of Automata","author":"J. Holub","year":"2003","unstructured":"Holub, J., Crochemore, M.: On the implementation of compact DAWG\u2019s. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 289\u2013294. Springer, Heidelberg (2003)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-Line Construction of Compact Directed Acyclic Word Graphs. To appear in Discrete Applied Mathematics (special issue for CPM 2001).","DOI":"10.1109\/SPIRE.2001.989743"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"Combinatorial Pattern Matching","author":"S. Inenaga","year":"2001","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 169\u2013180. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"15_CR14","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 \u2013 a review. Discrete Applied Mathematics\u00a0139(1-3), 197\u2013230 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01298926","volume":"101","author":"G. Larcher","year":"1986","unstructured":"Larcher, G.: On the distribution of sequences connected with good lattice points. Monatshefte Math.\u00a0101, 135\u2013150 (1986)","journal-title":"Monatshefte Math."},{"key":"15_CR16","volume-title":"Encyclopedia of Mathematics and its Applications","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, vol.\u00a017, Addison-Wesley, Reading (1983); Reprinted in the Cambridge Mathematical Library, Cambridge University Press (1997)."},{"key":"15_CR17","volume-title":"Encyclopedia of Mathematics and its Applications","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, vol.\u00a090, Cambridge University Press, Cambridge (2002)"},{"key":"15_CR18","volume-title":"Die Lehre von den Kettenbr\u00fcchen","author":"O. Perron","year":"1954","unstructured":"Perron, O.: Die Lehre von den Kettenbr\u00fcchen. B.\u00a0G.\u00a0Teubner, Stuttgart (1954)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(01)00152-1","volume":"83","author":"M. Raffinot","year":"2001","unstructured":"Raffinot, M.: On maximal repeats in strings. Inf. Proc. Letters\u00a083, 165\u2013169 (2001)","journal-title":"Inf. Proc. Letters"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","first-page":"165","volume-title":"Automata on Infinite Words","author":"G. Rauzy","year":"1985","unstructured":"Rauzy, G.: Mots infinis en arithm\u00e9tique. In: Perrin, D., Nivat, M. (eds.) Automata on Infinite Words. LNCS, vol.\u00a0192, pp. 165\u2013171. Springer, Heidelberg (1985)"},{"key":"15_CR21","first-page":"151","volume":"38","author":"J. Shallit","year":"1992","unstructured":"Shallit, J.: Real numbers with bounded partial quotients. Enseignement Math.\u00a038, 151\u2013187 (1992)","journal-title":"Enseignement Math."},{"key":"15_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/B978-0-12-775950-0.50009-1","volume-title":"Applications of Number Theory to Numerical Analysis","author":"S.K. Zaremba","year":"1972","unstructured":"Zaremba, S.K.: La m\u00e9thode de \u201cbons treillis\u201d pour le calcul des int\u00e9grales multiples. In: Zaremba, S.K. (ed.) Applications of Number Theory to Numerical Analysis, pp. 39\u2013119. Academic Press, London (1972)"}],"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-30550-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:31:23Z","timestamp":1558279883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}