{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:44:39Z","timestamp":1649191479285},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9360,"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":[[1987,12]]},"DOI":"10.1016\/s0166-218x(87)80007-0","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T20:06:18Z","timestamp":1121198778000},"page":"315-319","source":"Crossref","is-referenced-by-count":1,"title":["On some structural properties of a subclass of \u221e-regular languages"],"prefix":"10.1016","volume":"18","author":[{"given":"Ivan","family":"Mezn\u00edk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(87)80007-0_bib1","series-title":"Algebraic Lallice Theory","author":"Crawley","year":"1973"},{"key":"10.1016\/S0166-218X(87)80007-0_bib2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/S0166-218X(87)80007-0_bib3","series-title":"General Lattice Theory","author":"Gr\u00e4tzer","year":"1978"},{"key":"10.1016\/S0166-218X(87)80007-0_bib4","first-page":"1037","article-title":"On lattice properties of generable languages","volume":"8","author":"Meznik","year":"1974","journal-title":"Rev. Roum. Math. Pures et Appl."},{"key":"10.1016\/S0166-218X(87)80007-0_bib5","first-page":"203","article-title":"On finite [k]-machines and their languages","volume":"5-56","author":"Meznik","year":"1975","journal-title":"Kniz.Odb.aVed.Spisu VUT Brno"},{"key":"10.1016\/S0166-218X(87)80007-0_bib6","series-title":"Proc. of the MFCS-75 Marianske Lazne","first-page":"320","article-title":"On some lattice-theoretic properties of generable languages","volume":"32","author":"Mezn\u00edk","year":"1975"},{"key":"10.1016\/S0166-218X(87)80007-0_bib7","unstructured":"1. Mezn\u00edk, On a subclass of \u221e-regular languages, to appear."},{"key":"10.1016\/S0166-218X(87)80007-0_bib8","first-page":"5","article-title":"Infinite words, infinite trees, infinite computations","author":"Nival","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:05Z","timestamp":1548345245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X87800070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["S0166218X87800070"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(87)80007-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}