{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:53:12Z","timestamp":1768276392788,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0020-0190(91)90134-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"61-65","source":"Crossref","is-referenced-by-count":11,"title":["Prefix-free languages as \u03c9-generators"],"prefix":"10.1016","volume":"37","author":[{"given":"Igor","family":"Litovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90134-4_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0020-0190(91)90134-4_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherences of languages","volume":"20","author":"Boasson","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(91)90134-4_BIB3","series-title":"Proc. Congr. Logic. Method. and Philos. Sci.","first-page":"1","article-title":"On decision method in restricted second-order arithmetics","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0020-0190(91)90134-4_BIB4","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(91)90134-4_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90131-6","article-title":"Finitely generated \u03c9-languages","volume":"23","author":"Latteux","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90134-4_BIB6","series-title":"Algebraische Codierungs-theorie \u2014 Theorie der Sequentiellen Codierungen","author":"Lindner","year":"1977"},{"key":"10.1016\/0020-0190(91)90134-4_BIB7","article-title":"G\u00e9n\u00e9rateurs des langages rationnels de mots infinis","volume":"I","author":"Litovsky","year":"1988"},{"key":"10.1016\/0020-0190(91)90134-4_BIB8","first-page":"308","article-title":"Rank of rational finitely generated \u03c9-languages","volume":"380","author":"Litovsky","year":"1989"},{"key":"10.1016\/0020-0190(91)90134-4_BIB9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","article-title":"On generators of rational \u03c9-power languages","volume":"53","author":"Litovsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(91)90134-4_BIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(90)90046-K","article-title":"Codes with local constraints","volume":"72","author":"Restivo","year":"1990","journal-title":"Theoret. Comput. Sci."},{"issue":"5\/6","key":"10.1016\/0020-0190(91)90134-4_BIB11","first-page":"245","article-title":"A note on connected \u03c9-languages","volume":"16","author":"Staiger","year":"1980","journal-title":"EIK"},{"issue":"4","key":"10.1016\/0020-0190(91)90134-4_BIB12","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1051\/ita\/1986200404831","article-title":"On infinitary finite length codes","volume":"20","author":"Staiger","year":"1986","journal-title":"Theoret. Inform. Appl."},{"issue":"8\/9","key":"10.1016\/0020-0190(91)90134-4_BIB13","first-page":"415","article-title":"Research in the theory of \u03c9-languages","volume":"23","author":"Staiger","year":"1987","journal-title":"EIK"},{"key":"10.1016\/0020-0190(91)90134-4_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(83)90057-9","article-title":"A note on \u03c9-regular languages","volume":"23","author":"Takahashi","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(91)90134-4_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","article-title":"On \u03c9-regular sets","volume":"43","author":"Wagner","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90134-4_BIB16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(89)90152-7","article-title":"Language-theoretical representations of \u03c9-languages","volume":"66","author":"Yamasaki","year":"1989","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091901344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091901344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:23:31Z","timestamp":1555143811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091901344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0020019091901344"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90134-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}