{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:57:11Z","timestamp":1649069831461},"reference-count":9,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1051\/ita\/2011018","type":"journal-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T13:11:48Z","timestamp":1305292308000},"page":"225-234","source":"Crossref","is-referenced-by-count":0,"title":["Unique decipherability in the additive monoid of sets of numbers"],"prefix":"10.1051","volume":"45","author":[{"given":"Aleksi","family":"Saarela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,5,13]]},"reference":[{"key":"R1","unstructured":"J. Berstel and D. Perrin,Theory of Codes. Academic Press (1985)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"Brauer","year":"1942","journal-title":"Amer. J. Math."},{"key":"R3","unstructured":"Ch. Choffrut and J. Karhum\u00e4ki, Unique decipherability in the monoid of languages: an application of rational relations, inProceedings of the Fourth International Computer Science Symposium in Russia(2009) 71\u201379."},{"key":"R4","unstructured":"R. Gilmer,Commutative Semigroup Rings. University of Chicago Press (1984)."},{"key":"R5","unstructured":"J.-Y. Kao, J. Shallit and Z. Xu, The frobenius problem in a free monoid, inProceedings of the 25th International Symposium on Theoretical Aspects of Computer Science(2008) 421\u2013432."},{"key":"R6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1142\/S0129054103001960","volume":"14","author":"Karhum\u00e4ki","year":"2003","journal-title":"Int. J. Found. Comput. Sci."},{"key":"R7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00224-006-1321-z","volume":"40","author":"Kunc","year":"2007","journal-title":"Theor. Comput. Syst."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"D. Perrin, Codes conjugu\u00e9s.Inform. Control.20(1972) 222\u2013231.","DOI":"10.1016\/S0019-9958(72)90406-8"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"J.L. Ram\u00edrez Alfons\u00edn,The Diophantine Frobenius Problem. Oxford University Press (2005).","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011018\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:39:54Z","timestamp":1560195594000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":9,"journal-issue":{"issue":"2"},"alternative-id":["ita09053"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011018","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}