{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:38:32Z","timestamp":1648895912315},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"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":[[1989]]},"DOI":"10.1016\/0166-218x(92)90288-l","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T16:10:39Z","timestamp":1039536639000},"page":"237-246","source":"Crossref","is-referenced-by-count":0,"title":["Finite automata for languages of combinatorial interest: An order theoretical point of view"],"prefix":"10.1016","volume":"24","author":[{"given":"Rodica E.","family":"Simion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90288-L_BIB1","series-title":"Combinatorial Theory","author":"Aigner","year":"1980"},{"key":"10.1016\/0166-218X(92)90288-L_BIB2","first-page":"25","article-title":"On matroids, groups and exchange languages","volume":"40","author":"Bj\u00f6rner","year":"1985"},{"key":"10.1016\/0166-218X(92)90288-L_BIB3","series-title":"Ordered Sets","article-title":"An introduction to Cohen-Macaulay partially ordered sets","author":"Bj\u00f6rner","year":"1982"},{"key":"10.1016\/0166-218X(92)90288-L_BIB4","series-title":"Introduction to Automata Theory, Languages, and Computations","author":"Hoperoft","year":"1979"},{"key":"10.1016\/0166-218X(92)90288-L_BIB5","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(92)90288-L_BIB6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","article-title":"Restricted permutations","volume":"6","author":"Simion","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/0166-218X(92)90288-L_BIB7","doi-asserted-by":"crossref","unstructured":"R. Simion, Partially ordered sets associated with permutations, European J. Combin. (to appear.)","DOI":"10.1016\/S0195-6698(89)80010-1"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290288L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290288L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:43Z","timestamp":1555120543000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290288L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290288L"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90288-l","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}