乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:43:02Z","timestamp":1720201382044},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003134","name":"FRIA","doi-asserted-by":"publisher","award":["1.E030.16"],"id":[{"id":"10.13039\/501100003134","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":[[2019,2]]},"DOI":"10.1016\/j.tcs.2018.08.003","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T16:35:49Z","timestamp":1534782949000},"page":"42-60","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Convergence of Pascal-like triangles in Parry\u2013Bertrand numeration systems"],"prefix":"10.1016","volume":"758","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-2805-2465","authenticated-orcid":false,"given":"Manon","family":"Stipulanti","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.08.003_br0010","first-page":"453","article-title":"Hyperbolic Pascal triangles","volume":"273","author":"Belbachir","year":"2016","journal-title":"Appl. Math. Comput."},{"issue":"17","key":"10.1016\/j.tcs.2018.08.003_br0020","first-page":"15","article-title":"On the arithmetic triangles","volume":"9","author":"Belbachir","year":"2014","journal-title":"\u0160iauliai Math. Semin."},{"key":"10.1016\/j.tcs.2018.08.003_br0030","series-title":"Combinatorics, Automata and Number Theory","volume":"vol. 135","year":"2010"},{"key":"10.1016\/j.tcs.2018.08.003_br0040","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01952053","article-title":"Comment \u00e9crire les nombres entiers dans une base qui n'est pas enti\u00e8re","volume":"54","author":"Bertrand-Mathis","year":"1989","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/j.tcs.2018.08.003_br0050","article-title":"The minimal automaton recognizing mN in a linear numeration system","volume":"11B","author":"Charlier","year":"2011","journal-title":"Integers"},{"key":"10.1016\/j.tcs.2018.08.003_br0060","series-title":"The Geometry of Fractal Sets","author":"Falconer","year":"1985"},{"key":"10.1016\/j.tcs.2018.08.003_br0080","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1017\/S0143385700006908","article-title":"Pascal's triangle, dynamical systems and attractors","volume":"12","author":"von Haeseler","year":"1992","journal-title":"Ergodic Theory Dynam. Systems"},{"issue":"1","key":"10.1016\/j.tcs.2018.08.003_br0090","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219493705001250","article-title":"Self-similar corrections to the ergodic theorem for the Pascal-adic transformation","volume":"5","author":"Janvresse","year":"2005","journal-title":"Stoch. Dyn."},{"key":"10.1016\/j.tcs.2018.08.003_br0100","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.aam.2016.04.006","article-title":"Generalized Pascal triangle for binomial coefficients of words","volume":"80","author":"Leroy","year":"2016","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.tcs.2018.08.003_br0110","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1016\/j.disc.2017.01.003","article-title":"Counting the number of non-zero coefficients in rows of generalized Pascal triangles","volume":"340","author":"Leroy","year":"2017","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2018.08.003_br0120","doi-asserted-by":"crossref","DOI":"10.37236\/6581","article-title":"Behavior of digital sequences through exotic numeration systems","volume":"24","author":"Leroy","year":"2017","journal-title":"Electron. J. Combin."},{"issue":"A13","key":"10.1016\/j.tcs.2018.08.003_br0130","article-title":"Counting subword occurrences in base-b expansions","volume":"18A","author":"Leroy","year":"2018","journal-title":"Integers"},{"key":"10.1016\/j.tcs.2018.08.003_br0140","series-title":"Combinatorics on Words","author":"Lothaire","year":"1997"},{"key":"10.1016\/j.tcs.2018.08.003_br0150","article-title":"Algebraic Combinatorics on Words","volume":"vol. 90","author":"Lothaire","year":"2002"},{"key":"10.1016\/j.tcs.2018.08.003_br0170","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02020954","article-title":"On the \u03b2-expansions of real numbers","volume":"11","author":"Parry","year":"1960","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.tcs.2018.08.003_br0180","series-title":"Formal Languages, Automata and Numeration Systems. 1. Introduction to Combinatorics on Words","author":"Rigo","year":"2014"},{"key":"10.1016\/j.tcs.2018.08.003_br0190","series-title":"Formal Languages, Automata and Numeration Systems. 2. Applications to Recognizability and Decidability","author":"Rigo","year":"2014"},{"key":"10.1016\/j.tcs.2018.08.003_br0200","author":"Sloane"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751830519X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751830519X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T10:11:47Z","timestamp":1712398307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751830519X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":18,"alternative-id":["S030439751830519X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.003","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Convergence of Pascal-like triangles in Parry\u2013Bertrand numeration systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}