{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T15:22:37Z","timestamp":1783092157395,"version":"3.54.6"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018628","name":"Scientific Research Foundation of Education Department of Anhui Province of China","doi-asserted-by":"publisher","award":["2025J0581"],"award-info":[{"award-number":["2025J0581"]}],"id":[{"id":"10.13039\/501100018628","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,7]]},"DOI":"10.1016\/j.tcs.2026.116024","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T06:56:21Z","timestamp":1779432981000},"page":"116024","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bernoulli sets over ternary and multiletter alphabets: Algebraic characterizations, polynomial divisibility, and commutative prefix properties"],"prefix":"10.1016","volume":"1080","author":[{"given":"Haiyan","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rongdong","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116024_bib0001","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1214\/aoms\/1177704860","article-title":"On a special class of recurrent events","volume":"32","author":"Sch\u00fctzenberger","year":"1961","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.tcs.2026.116024_bib0002","series-title":"Semigroups","first-page":"545","article-title":"A property of finitely generated submonoids","author":"Sch\u00fctzenberger","year":"1979"},{"key":"10.1016\/j.tcs.2026.116024_bib0003","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01744574","article-title":"Codes and Bernoulli partitions","volume":"16","author":"Hansel","year":"1983","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.tcs.2026.116024_bib0004","series-title":"Codes and Automata","author":"Berstel","year":"2010"},{"key":"10.1016\/j.tcs.2026.116024_bib0005","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0304-3975(00)00438-2","article-title":"Some combinatorial results on Bernoulli sets and codes","volume":"273","author":"de Luca","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116024_bib0006","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1051\/ita:2005010","article-title":"Some decompositions of Bernoulli sets and codes","volume":"39","author":"de Luca","year":"2005","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.tcs.2026.116024_bib0007","first-page":"270","article-title":"Codes et sous-monoides poss\u00e9dant des mots neutres","volume":"4","author":"Perrin","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116024_bib0008","series-title":"Th\u00e9orie de l\u2019Information, Colloques Internationaux du CNRS","first-page":"249","article-title":"Un probl\u00e8me \u00e9l\u00e9mentaire de la th\u00e9orie de l\u2019information","volume":"276","author":"Perrin","year":"1978"},{"key":"10.1016\/j.tcs.2026.116024_bib0009","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0095-8956(81)90096-4","article-title":"A conjecture on differences of integer","volume":"30","author":"Perrin","year":"1981","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.tcs.2026.116024_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(81)90064-8","article-title":"A family of codes commutatively equivalent to prefix codes","volume":"12","author":"Mauceri","year":"1981","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.116024_bib0011","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"23","article-title":"Open problems about regular languages","author":"Brzozowski","year":"1980"},{"key":"10.1016\/j.tcs.2026.116024_bib0012","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1142\/S0129054121500192","article-title":"On the commutative equivalence of algebraic formal series and languages","volume":"32","author":"Carpi","year":"2021","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116024_bib0013","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0097-3165(85)90032-9","article-title":"A counterexample to the triangle conjecture","volume":"38","author":"Shor","year":"1983","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"10.1016\/j.tcs.2026.116024_bib0014","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.disc.2016.10.008","article-title":"Finite maximal codes and triangle conjecture","volume":"340","author":"Zhang","year":"2017","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.116024_bib0015","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(81)90634-3","article-title":"The characterization of non-expansive grammars by rational power series","volume":"48","author":"Baron","year":"1981","journal-title":"Inf. Contr."},{"key":"10.1016\/j.tcs.2026.116024_bib0016","series-title":"Algebra","author":"Lang","year":"2002"},{"key":"10.1016\/j.tcs.2026.116024_bib0017","series-title":"Automata, Languages and Machines, Vol. A","author":"Eilenberg","year":"1976"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002744?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002744?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T15:03:11Z","timestamp":1783090991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":17,"alternative-id":["S0304397526002744"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116024","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bernoulli sets over ternary and multiletter alphabets: Algebraic characterizations, polynomial divisibility, and commutative prefix properties","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116024","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":"116024"}}