{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:31:01Z","timestamp":1648888261924},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00393-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"627-641","source":"Crossref","is-referenced-by-count":1,"title":["The disjunctivities of \u03c9-languages"],"prefix":"10.1016","volume":"127","author":[{"given":"Y.T","family":"Yeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00393-1_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(97)00061-9","article-title":"Language-theoretic complexity of disjunctive sequences","volume":"80","author":"Calude","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB2","unstructured":"S.W. Jiang, H.J. Shyr, S.S. Yu, Completely disjunctive languages, Periodica Polytechnica Transportation Engineering, Proceedings of the Second International Mathematical Mini Conference, Part II, Vol. 19, No. 1\u20132, Budapest, 1988, 1991, pp. 101\u2013110."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB3","first-page":"6","article-title":"Disjunctive \u03c9-languages","volume":"EIK 19","author":"J\u00fcrgensen","year":"1983","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB4","first-page":"513","article-title":"Which monoids are syntactic monoids of \u03c9-languages?","volume":"EIK 22","author":"J\u00fcrgensen","year":"1986","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB5","unstructured":"H. J\u00fcrgensen, G. Thierrin, Some structural properties of \u03c9-languages, in: Proceedings of the 13th National School with International Participation Applications of Mathematics in Technology, Sofia, 1988, pp. 56\u201363."},{"issue":"1","key":"10.1016\/S0166-218X(02)00393-1_BIB6","first-page":"13","article-title":"Omega-syntactic congruences","volume":"1","author":"Kari","year":"1996","journal-title":"J. Automat. Languages Combin."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = bNcP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00312-X","article-title":"On syntactic congruences for \u03c9-languages","volume":"183","author":"Maler","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0166-218X(02)00393-1_BIB9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0019-9958(78)90578-8","article-title":"Some properties of disjunctive languages on a free monoid","volume":"37","author":"Reis","year":"1978","journal-title":"Inform. Control"},{"key":"10.1016\/S0166-218X(02)00393-1_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02573454","article-title":"A characterization of dense languages","volume":"30","author":"Shyr","year":"1984","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0166-218X(02)00393-1_BIB11","series-title":"Free Monoids and Languages","author":"Shyr","year":"1991"},{"key":"10.1016\/S0166-218X(02)00393-1_BIB12","first-page":"127","article-title":"Some properties of dense languages","volume":"10","author":"Shyr","year":"1984","journal-title":"Soochow J. Math."},{"key":"10.1016\/S0166-218X(02)00393-1_BIB13","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","article-title":"Research in the theory of \u03c9-languages","volume":"27","author":"Staiger","year":"1983","journal-title":"J. Comput. System Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003931?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003931?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T06:36:02Z","timestamp":1622788562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003931"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00393-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}