{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:49Z","timestamp":1726410109676},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_32","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"362-373","source":"Crossref","is-referenced-by-count":5,"title":["Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure"],"prefix":"10.1007","author":[{"given":"Victor","family":"Marsault","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1016\/j.tcs.2009.02.006","volume":"410","author":"J.-P. Allouche","year":"2009","unstructured":"Allouche, J.-P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci.\u00a0410, 2795\u20132803 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2008.01.003","volume":"107","author":"J. Almeida","year":"2008","unstructured":"Almeida, J., Zeitoun, M.: Description and analysis of a bottom-up DFA minimization algorithm. Inf. Process. Lett.\u00a0107(2), 52\u201359 (2008)","journal-title":"Inf. Process. Lett."},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Soc. Math.\u00a01, 191\u2013238 (1994); Corrigendum. Bull. Belg. Soc. Math.\u00a01, 577 (1994)","journal-title":"Bull. Belg. Soc. Math."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependance of the sets of numbers recognizable by finite automata. Math. Systems Theory\u00a03, 186\u2013192 (1969)","journal-title":"Math. Systems Theory"},{"key":"32_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"32_CR7","unstructured":"Durand, F., Rigo, M.: On Cobham\u2019s theorem, HAL-00605375. Pin, J.-E. (ed.) To Appear in AutoMathA Handbook. E.M.S. (2011)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01368783","volume":"25","author":"C. Frougny","year":"1992","unstructured":"Frougny, C.: Representation of numbers and finite automata. Math. Systems Theory\u00a025, 37\u201360 (1992)","journal-title":"Math. Systems Theory"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Frougny, C., Sakarovitch, J.: Number representation and finite automata. In: Berth\u00e9, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications, vol.\u00a0135, pp. 34\u2013107. Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511777653.003"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas and languages. Pacif. J. Math.\u00a016, 285\u2013296 (1966)","journal-title":"Pacif. J. Math."},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1986200403951","volume":"20","author":"J. Honkala","year":"1986","unstructured":"Honkala, J.: A decision method for the recognizability of sets defined by number systems. RAIRO Theor. Informatics and Appl.\u00a020, 395\u2013403 (1986)","journal-title":"RAIRO Theor. Informatics and Appl."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Lecomte, P., Rigo, M.: Abstract numeration systems. In: Berth\u00e9, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications, vol.\u00a0135, pp. 108\u2013162. Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511777653.004"},{"key":"32_CR13","unstructured":"Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagrams. In: Logic in Computer Science 2005 (LICS 2005), pp. 147\u2013156. IEEE Comp. Soc. Press (2005); New version at arXiv:cs\/0612037v1"},{"key":"32_CR14","unstructured":"Marsault, V., Sakarovitch, J.: Ultimate periodicity of b-recognisable sets: a quasilinear procedure, http:\/\/arxiv.org\/abs\/1301.2691"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1016\/S0304-3975(02)00047-6","volume":"290","author":"A. Muchnik","year":"1991","unstructured":"Muchnik, A.: The definable criterion for definability in Presburger arithmetic and its applications. Theoret. Computer Sci.\u00a0290, 1433\u20131444 (1991)","journal-title":"Theoret. Computer Sci."},{"key":"#cr-split#-32_CR16.1","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"#cr-split#-32_CR16.2","unstructured":"Corrected English translation of \u00c9l\u00e9ments de th\u00e9orie des automates. Vuibert (2003)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T22:16:43Z","timestamp":1595888203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}