{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:56:20Z","timestamp":1768262180809,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90046-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"55-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"title":["Codes and local constraints"],"prefix":"10.1016","volume":"72","author":[{"given":"Antonio","family":"Restivo","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90046-K_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1983.1056597","article-title":"Algorithms for sliding block codes","volume":"29","author":"Adler","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(90)90046-K_BIB2","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TIT.1986.1057125","article-title":"State splitting for variable-length graphs","volume":"32","author":"Adler","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(90)90046-K_BIB3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0304-3975(88)90043-6","article-title":"Codes circulaires, automates locaux et entropie","volume":"57","author":"B\u00e9al","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90046-K_BIB4","first-page":"255","article-title":"Une caract\u00e9risation des ensembles sofiques","volume":"303","author":"B\u00e9al","year":"1986","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(90)90046-K_BIB5","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0304-3975(90)90046-K_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(86)90108-8","article-title":"Syst\u00e8mes cod\u00e9s","volume":"44","author":"Blanchard","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90046-K_BIB7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0019-9958(80)90180-1","article-title":"A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup","volume":"44","author":"de Luca","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90046-K_BIB8","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(90)90046-K_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(69)90395-7","article-title":"On synchronous variable length coding for discrete noiseless channel","volume":"1","author":"Franaszek","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90046-K_BIB10","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1147\/rd.245.0638","article-title":"A general method for channel coding","volume":"24","author":"Franaszek","year":"1980","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0304-3975(90)90046-K_BIB11","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1147\/rd.264.0506","article-title":"Construction of bounded delay codes for discrete noiseless channel","volume":"26","author":"Franaszek","year":"1982","journal-title":"IBM J. Res Dev."},{"key":"10.1016\/0304-3975(90)90046-K_BIB12","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1109\/TIT.1985.1057037","article-title":"Sofic systems and encoding data","volume":"31","author":"Marcus","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(90)90046-K_BIB13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0019-9958(74)90821-3","article-title":"On a question of McNaughton and Papert","volume":"25","author":"Restivo","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90046-K_BIB14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(75)90015-8","article-title":"A combinatorial property of codes having finite synchronization delay","volume":"1","author":"Restivo","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90046-K_BIB15","article-title":"Codes with constraints","author":"Restivo","year":"1986","journal-title":"Report Dip. Mat. Palermo"},{"key":"10.1016\/0304-3975(90)90046-K_BIB16","first-page":"245","article-title":"Sur certaines op\u00e9rations de fermature dans les lungages rationnels","volume":"15","author":"Sch\u00fctzenberger","year":"1975","journal-title":"Sympos. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090046K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090046K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:18Z","timestamp":1757477898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090046K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090046K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90046-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Codes and local constraints","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90046-K","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}