{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T08:11:34Z","timestamp":1774080694201,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115843","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:42:09Z","timestamp":1772264529000},"page":"115843","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computing the base-b representation of quadratic irrationals using automata"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7371-9564","authenticated-orcid":false,"given":"Aaron","family":"Barnoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0462-625X","authenticated-orcid":false,"given":"Curtis","family":"Bright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1197-3820","authenticated-orcid":false,"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115843_bib0001","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1098\/rspl.1872.0066","article-title":"On the extension of the numerical value of \u03c0","volume":"21","author":"Shanks","year":"1873","journal-title":"Proc. R. Soc. London"},{"key":"10.1016\/j.tcs.2026.115843_bib0002","doi-asserted-by":"crossref","unstructured":"J. Shallit, Calculation of 5 and \u03d5 (the golden ratio) to 10,000 decimal places, 1976. Reviewed in Math. Comp.30(1976), 377.","DOI":"10.2307\/2005988"},{"key":"10.1016\/j.tcs.2026.115843_bib0003","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","article-title":"On the rapid computation of various polylogarithmic constants","volume":"66","author":"Bailey","year":"1997","journal-title":"Math. Comp."},{"key":"10.1016\/j.tcs.2026.115843_bib0004","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Amer. Math. Soc."},{"key":"10.1016\/j.tcs.2026.115843_bib0005","series-title":"IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory","first-page":"51","article-title":"On the Hartmanis-Stearns problem for a class of tag machines","author":"Cobham","year":"1968"},{"key":"10.1016\/j.tcs.2026.115843_bib0006","doi-asserted-by":"crossref","first-page":"547","DOI":"10.4007\/annals.2007.165.547","article-title":"On the complexity of algebraic numbers I. Expansions in integer bases","volume":"165","author":"Adamczewski","year":"2007","journal-title":"Ann. Math."},{"key":"10.1016\/j.tcs.2026.115843_bib0007","series-title":"Implementation and Application of Automata","first-page":"35","article-title":"Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals","author":"Barnoff","year":"2024"},{"key":"10.1016\/j.tcs.2026.115843_bib0008","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1051\/ita:2001129","article-title":"On synchronized sequences and their separators","volume":"35","author":"Carpi","year":"2001","journal-title":"RAIRO Inform. Theor. App."},{"key":"10.1016\/j.tcs.2026.115843_bib0009","series-title":"WORDS 2021","first-page":"1","article-title":"Synchronized sequences","volume":"12847","author":"Shallit","year":"2021"},{"key":"10.1016\/j.tcs.2026.115843_bib0010","first-page":"190","article-title":"Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci","volume":"29","author":"Lekkerkerker","year":"1952","journal-title":"Simon Stevin"},{"key":"10.1016\/j.tcs.2026.115843_bib0011","first-page":"179","article-title":"Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas","volume":"41","author":"Zeckendorf","year":"1972","journal-title":"Bull. Soc. R. Liege"},{"key":"10.1016\/j.tcs.2026.115843_bib0012","article-title":"The Logical Approach To Automatic Sequences: Exploring Combinatorics on Words with Walnut","volume":"482","author":"Shallit","year":"2023"},{"key":"10.1016\/j.tcs.2026.115843_bib0013","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1051\/ita\/2016010","article-title":"Decision algorithms for Fibonacci-automatic words, I: basic results","volume":"50","author":"Mousavi","year":"2016","journal-title":"RAIRO Inform. Theor. App."},{"key":"10.1016\/j.tcs.2026.115843_bib0014","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1090\/S0025-5718-1993-1192972-X","article-title":"Continued fractions and linear recurrences","volume":"61","author":"Lenstra","year":"1993","journal-title":"Math. Comp."},{"key":"10.1016\/j.tcs.2026.115843_bib0015","series-title":"WORDS 2019","first-page":"80","article-title":"Critical exponent of infinite balanced words via the Pell number system","volume":"11682","author":"Baranwal","year":"2019"},{"key":"10.1016\/j.tcs.2026.115843_bib0016","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.tcs.2021.01.018","article-title":"Ostrowski-automatic sequences: theory and applications","volume":"858","author":"Baranwal","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115843_bib0017","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02940581","article-title":"Bemerkungen zur theorie der diophantischen approximationen","volume":"1","author":"Ostrowski","year":"1922","journal-title":"Abh. Math. Sem. Hamburg"},{"key":"10.1016\/j.tcs.2026.115843_bib0018","unstructured":"L. Schaeffer, J. Shallit, S. Zorcic, Beatty sequences for a quadratic irrational: Decidability and applications, 2024. arXiv: 2402.08331[math.NT]."},{"key":"10.1016\/j.tcs.2026.115843_bib0019","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. Contr."},{"key":"10.1016\/j.tcs.2026.115843_bib0020","series-title":"Software Engineering and Formal Methods: SEFM 2017 Collocated Workshops","first-page":"117","article-title":"Finding all minimum-size DFA consistent with given examples: SAT-based approach","volume":"10729","author":"Zakirzyanov","year":"2018"},{"key":"10.1016\/j.tcs.2026.115843_bib0021","series-title":"Maple in Mathematics Education and Research","first-page":"205","article-title":"Effective problem solving using SAT solvers","author":"Bright","year":"2020"},{"key":"10.1016\/j.tcs.2026.115843_bib0022","series-title":"Proc. of SAT Competition 2020 \u2013 Solver and Benchmark Descriptions","first-page":"51","article-title":"CaDiCaL, kissat, paracooba, plingeling and treengeling entering the SAT competition 2020","volume":"B-2020-1","author":"Biere","year":"2020"},{"key":"10.1016\/j.tcs.2026.115843_bib0023","series-title":"ICGI 2010","first-page":"66","article-title":"Exact DFA identification using SAT solvers","volume":"6339","author":"Heule","year":"2010"},{"key":"10.1016\/j.tcs.2026.115843_bib0024","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","article-title":"Practical graph isomorphism, II","volume":"60","author":"McKay","year":"2014","journal-title":"J. Symb. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.115843_bib0025","first-page":"113","article-title":"Minimal primes","volume":"30","author":"Shallit","year":"2000","journal-title":"J. Recreational Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:37:09Z","timestamp":1774078629000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":25,"alternative-id":["S0304397526001027"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115843","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing the base-b representation of quadratic irrationals using automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115843","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115843"}}