{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:03Z","timestamp":1725516723876},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_10","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"112-123","source":"Crossref","is-referenced-by-count":1,"title":["On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Boigelot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Brusten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-540-73420-8_70","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"2007","unstructured":"Boigelot, B., Brusten, J.: A generalization of Cobham\u2019s theorem to automata over real numbers. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 813\u2013824. Springer, Heidelberg (2007)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-63166-6_18","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1997","unstructured":"Boigelot, B., Bronne, L., Rassart, S.: An improved reachability analysis method for strongly linear hybrid systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 167\u2013177. Springer, Heidelberg (1997)"},{"issue":"2","key":"10_CR3","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. Bulletin of the Belgian Mathematical Society\u00a01(2), 191\u2013238 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B. Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Transactions on Computational Logic\u00a06(3), 614\u2013633 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0055049","volume-title":"Automata, Languages and Programming","author":"B. Boigelot","year":"1998","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 152\u2013163. Springer, Heidelberg (1998)"},{"key":"10_CR6","first-page":"1","volume-title":"Proc. International Congress on Logic, Methodoloy and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. International Congress on Logic, Methodoloy and Philosophy of Science, pp. 1\u201312. Stanford University Press, Stanford (1962)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory\u00a03, 186\u2013192 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11817963_10","volume-title":"Computer Aided Verification","author":"J. Eisinger","year":"2006","unstructured":"Eisinger, J., Klaedtke, F.: Don\u2019t care words with an application to the automata-based approach for real addition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 67\u201380. Springer, Heidelberg (2006)"},{"key":"10_CR9","volume-title":"An introduction to the theory of numbers","author":"G.H. Hardy","year":"1985","unstructured":"Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers, 5th edn. Oxford University Press, Oxford (1985)","edition":"5"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control\u00a09(5), 521\u2013530 (1966)","journal-title":"Information and Control"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"10_CR12","volume-title":"Infinite words. Pure and Applied Mathematics","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"10_CR13","first-page":"319","volume-title":"Proc. 29th Symposium on Foundations of Computer Science","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. 29th Symposium on Foundations of Computer Science, pp. 319\u2013327. IEEE Computer Society, Los Alamitos (1988)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-70918-3_2","volume-title":"STACS 2007","author":"M. Vardi","year":"2007","unstructured":"Vardi, M.: The B\u00fcchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 12\u201322. Springer, Heidelberg (2007)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-60360-3_30","volume-title":"Static Analysis","author":"P. Wolper","year":"1995","unstructured":"Wolper, P., Boigelot, B.: An automata-theoretic approach to Presburger arithmetic constraints. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 21\u201332. Springer, Heidelberg (1995)"},{"key":"10_CR16","first-page":"129","volume-title":"Proc. ACM SIGSAM ISSAC, Vancouver","author":"V. Weispfenning","year":"1999","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: Proc. ACM SIGSAM ISSAC, Vancouver, pp. 129\u2013136. ACM Press, New York (1999)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/3-540-56503-5_60","volume-title":"STACS 93","author":"T. Wilke","year":"1993","unstructured":"Wilke, T.: Locally threshold testable languages of infinite words. In: Enjalbert, P., Wagner, K.W., Finkel, A. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 607\u2013616. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:30Z","timestamp":1620001410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}