{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T06:10:00Z","timestamp":1674886200840},"reference-count":31,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:p>We address the following decision problem. Given a numeration system U and a U-recognizable set [Formula: see text], i.e. the set of its greedy U-representations is recognized by a finite automaton, decide whether or not X is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linear recurrence sequences. Based on arithmetical considerations about the recurrence equation and on p-adic methods, the DFA given as input provides a bound on the admissible periods to test.<\/jats:p>","DOI":"10.1142\/s0218196722500254","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T10:31:01Z","timestamp":1646044261000},"page":"561-596","source":"Crossref","is-referenced-by-count":0,"title":["Ultimate periodicity problem for linear numeration systems"],"prefix":"10.1142","volume":"32","author":[{"given":"\u00c9.","family":"Charlier","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Li\u00e8ge, All\u00e9e de la d\u00e9couverte 12 (B37), B-4000 Li\u00e8ge, Belgium"}]},{"given":"A.","family":"Massuir","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Li\u00e8ge, All\u00e9e de la d\u00e9couverte 12 (B37), B-4000 Li\u00e8ge, Belgium"}]},{"given":"M.","family":"Rigo","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Li\u00e8ge, All\u00e9e de la d\u00e9couverte 12 (B37), B-4000 Li\u00e8ge, Belgium"}]},{"given":"E.","family":"Rowland","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hofstra University, Hempstead, NY, USA"}]}],"member":"219","published-online":{"date-parts":[[2022,2,26]]},"reference":[{"key":"S0218196722500254BIB001","first-page":"15","volume-title":"29th Int. Conf. on Concurrency Theory","volume":"118","author":"Almagor S.","year":"2018"},{"key":"S0218196722500254BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196709005330"},{"key":"S0218196722500254BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/BF01952053"},{"key":"S0218196722500254BIB004","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777653"},{"key":"S0218196722500254BIB005","first-page":"14","volume-title":"44th Int. Colloquium on Automata, Languages, and Programming","volume":"80","author":"Boigelot B.","year":"2017"},{"key":"S0218196722500254BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00260-5"},{"key":"S0218196722500254BIB007","doi-asserted-by":"publisher","DOI":"10.36045\/bbms\/1103408547"},{"key":"S0218196722500254BIB008","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972718000515"},{"key":"S0218196722500254BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/BF01746527"},{"key":"S0218196722500254BIB010","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2013035"},{"key":"S0218196722500254BIB011","doi-asserted-by":"publisher","DOI":"10.4171\/Automata-1\/26"},{"key":"S0218196722500254BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1985.11971550"},{"key":"S0218196722500254BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/BF01368783"},{"key":"S0218196722500254BIB014","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2650"},{"key":"S0218196722500254BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59058-0"},{"key":"S0218196722500254BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000082"},{"key":"S0218196722500254BIB017","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1986200403951"},{"key":"S0218196722500254BIB018","first-page":"175","volume":"116","author":"Lacroix A.","year":"2012","journal-title":"Fund. Inform."},{"key":"S0218196722500254BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s002240010014"},{"key":"S0218196722500254BIB020","doi-asserted-by":"publisher","DOI":"10.5802\/jtnb.153"},{"key":"S0218196722500254BIB021","series-title":"Mathematical Surveys","volume-title":"The Geometry of the Zeros of a Polynomial in a Complex Variable","volume":"3","author":"Marden M.","year":"1949"},{"key":"S0218196722500254BIB022","first-page":"30","volume":"15","author":"Marsault V.","year":"2019","journal-title":"Log. Methods Comput. Sci."},{"key":"S0218196722500254BIB023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38771-5_32"},{"key":"S0218196722500254BIB025","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562416020253"},{"key":"S0218196722500254BIB026","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.27"},{"key":"S0218196722500254BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_27"},{"key":"S0218196722500254BIB028","series-title":"Networks and Telecommunications Series","doi-asserted-by":"crossref","DOI":"10.1002\/9781119008200","volume-title":"Formal Languages, Automata and Numeration Systems: Applications to Recognizability and Decidability","volume":"2","author":"Rigo M.","year":"2014"},{"key":"S0218196722500254BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.indag.2016.11.019"},{"key":"S0218196722500254BIB030","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218"},{"key":"S0218196722500254BIB031","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0"},{"key":"S0218196722500254BIB032","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1076"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196722500254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T01:40:24Z","timestamp":1674870024000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218196722500254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,26]]},"references-count":31,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["10.1142\/S0218196722500254"],"URL":"https:\/\/doi.org\/10.1142\/s0218196722500254","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,26]]}}}