{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:57:45Z","timestamp":1776859065530,"version":"3.51.2"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p> A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. <\/jats:p><jats:p> We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many regular monoids. <\/jats:p>","DOI":"10.1142\/s0218196709005457","type":"journal-article","created":{"date-parts":[[2010,1,28]],"date-time":"2010-01-28T10:30:36Z","timestamp":1264674636000},"page":"1011-1023","source":"Crossref","is-referenced-by-count":4,"title":["CODING PARTITIONS OF REGULAR SETS"],"prefix":"10.1142","volume":"19","author":[{"given":"MARIE-PIERRE","family":"B\u00c9AL","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Est, Laboratoire d'informatique Gaspard-Monge, CNRS, 77454 Marne-la-Vall\u00e9e Cedex 2, France"}]},{"given":"FABIO","family":"BURDERI","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica ed Applicazioni, Universit\u00e0 degli studi di Palermo, Via Archirafi 34, 90123 Palermo, Italy"}]},{"given":"ANTONIO","family":"RESTIVO","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica ed Applicazioni, Universit\u00e0 degli studi di Palermo, Via Archirafi 34, 90123 Palermo, Italy"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.043"},{"key":"rf2","series-title":"Pure and Applied Mathematics","volume-title":"Theory of Codes","volume":"117","author":"Berstel J.","year":"1985"},{"key":"rf3","first-page":"227","volume":"9","author":"Burderi F.","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"rf5","series-title":"Pure and Applied Mathematics","volume-title":"Automata, Languages, and Machines, Vol. A","volume":"58","author":"Eilenberg S.","year":"1974"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(98)00019-X"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00254-0"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057217"},{"key":"rf11","unstructured":"D.\u00a0Perrin, Handbook of Theoretical Computer Science\u00a0B (Elsevier, Amsterdam, 1990)\u00a0pp. 1\u201357."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/18.30991"},{"key":"rf13","volume-title":"\u00c9l\u00e9ments de Th\u00e9orie des Automates","author":"Sakarovitch J.","year":"2003"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196709005457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:21:31Z","timestamp":1565130091000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196709005457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":11,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1142\/S0218196709005457"],"URL":"https:\/\/doi.org\/10.1142\/s0218196709005457","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}