{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T17:48:29Z","timestamp":1776707309871,"version":"3.51.2"},"reference-count":18,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1215\/00294527-2017-0027","type":"journal-article","created":{"date-parts":[[2017,12,23]],"date-time":"2017-12-23T03:05:13Z","timestamp":1513998313000},"source":"Crossref","is-referenced-by-count":5,"title":["Ostrowski Numeration Systems, Addition, and Finite Automata"],"prefix":"10.1215","volume":"59","author":[{"given":"Philipp","family":"Hieronymi","sequence":"first","affiliation":[]},{"given":"Alonza","family":"Terry Jr.","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Du, C. F., H. Mousavi, L. Schaeffer, and J. Shallit, \u201cDecision algorithms for Fibonacci-automatic words, with applications to pattern avoidance,\u201d preprint, <a href=\"arXiv:1406.0670v4\">arXiv:1406.0670v4<\/a> [cs.FL].","DOI":"10.1142\/S0129054116500386"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Allouche, J.-P., and J. Shallit, <i>Automatic Sequences: Theory, Applications, Generalizations<\/i>, Cambridge University Press, Cambridge, 2003.","DOI":"10.1017\/CBO9780511546563"},{"key":"1","unstructured":"[1] Ahlbach, C., J. Usatine, C. Frougny, and N. Pippenger, \u201cEfficient algorithms for Zeckendorf arithmetic,\u201d <i>Fibonacci Quarterly<\/i>, vol. 51 (2013), pp. 249\u201355."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Berth\u00e9, V., \u201cAutour du syst\u00e8me de num\u00e9ration d\u2019Ostrowski,\u201d <i>Bulletin of the Belgian Mathematical Society, Simon Stevin<\/i>, vol. 8 (2001), pp. 209\u201339.","DOI":"10.36045\/bbms\/1102714170"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Bruy\u00e8re, V., and G. Hansel, \u201cBertrand numeration systems and recognizability,\u201d <i>Theoretical Computer Science<\/i>, vol. 181 (1997), pp. 17\u201343.","DOI":"10.1016\/S0304-3975(96)00260-5"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Bruy\u00e8re, V., G. Hansel, C. Michaux, and R. Villemaire, \u201cLogic and $p$-recognizable sets of integers,\u201d <i>Bulletin of the Belgian Mathematical Society, Simon Stevin<\/i>, vol. 1 (1994), pp. 191\u2013238.","DOI":"10.36045\/bbms\/1103408547"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] B\u00fcchi, J. R., \u201cWeak second-order arithmetic and finite automata,\u201d <i>Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 6 (1960), pp. 66\u201392.","DOI":"10.1002\/malq.19600060105"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Frougny, C., \u201cRepresentations of numbers and finite automata,\u201d <i>Mathematical Systems Theory<\/i>, vol. 25 (1992), pp. 37\u201360.","DOI":"10.1007\/BF01368783"},{"key":"9","unstructured":"[9] Frougny, C., personal communication, July 2014."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Hieronymi, P., \u201cExpansions of the ordered additive group of real numbers by two discrete subgroups,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 81 (2016), pp. 1007\u201327.","DOI":"10.1017\/jsl.2015.34"},{"key":"11","unstructured":"[11] Hodgson, B. R., \u201cD\u00e9cidabilit\u00e9 par automate fini,\u201d <i>Annales des Sciences Math\u00e9matiques du Qu\u00e9bec<\/i>, vol. 7 (1983), pp. 39\u201357."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Khoussainov, B., and A. Nerode, <i>Automata Theory and Its Applications<\/i>, vol. 21 of <i>Progress in Computer Science and Applied Logic<\/i>, Birkh\u00e4user, Boston, 2001.","DOI":"10.1007\/978-1-4612-0171-7"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Loraud, N., \u201c$\\beta$-shift, syst\u00e8mes de num\u00e9ration et automates,\u201d <i>Journal de Th\u00e9orie des Nombres de Bordeaux<\/i>, vol. 7 (1995), pp. 473\u201398.","DOI":"10.5802\/jtnb.153"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Ostrowski, A., \u201cBemerkungen zur Theorie der Diophantischen Approximationen,\u201d <i>Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg<\/i>, vol. 1 (1922), pp. 77\u201398.","DOI":"10.1007\/BF02940581"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Rockett, A. M., and P. Sz\u00fcsz, <i>Continued Fractions<\/i>, World Scientific, River Edge, N.J., 1992.","DOI":"10.1142\/1725"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Shallit, J., \u201cNumeration systems, linear recurrences, and regular sets,\u201d <i>Information and Computation<\/i>, vol. 113 (1994), pp. 331\u201347.","DOI":"10.1006\/inco.1994.1076"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Villemaire, R., \u201cThe theory of $\\langle\\textbf{N},+,V_{k},V_{l}\\rangle$ is undecidable,\u201d <i>Theoretical Computer Science<\/i>, vol. 106 (1992), pp. 337\u201349.","DOI":"10.1016\/0304-3975(92)90256-F"},{"key":"18","unstructured":"[18] Zeckendorf, E., \u201cRepr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas,\u201d <i>Bulletin de la Soci\u00e9t\u00e9 Royale des Sciences de Li\u00e8ge<\/i>, vol. 41 (1972), pp. 179\u201382."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2017-0027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:24Z","timestamp":1706648364000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-59\/issue-2\/Ostrowski-Numeration-Systems-Addition-and-Finite-Automata\/10.1215\/00294527-2017-0027.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":18,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2017-0027","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}