{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:53:51Z","timestamp":1676681631616},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00036-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:04:53Z","timestamp":1027631093000},"page":"131-152","source":"Crossref","is-referenced-by-count":7,"title":["On well quasi orders of free monoids"],"prefix":"10.1016","volume":"204","author":[{"given":"Lucian","family":"Ilie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00036-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59136-5_6","article-title":"Combinatorics of words","author":"Choffrut","year":"1997"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(66)90083-0","article-title":"On a question of Eggan","volume":"9","author":"Dejean","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB3","article-title":"Unavoidable regularity and finiteness conditions","author":"de Luca","year":"1997"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB4","first-page":"255","article-title":"Sets having divisor property, Solution to problem 4358","volume":"59","author":"Erd\u00f6s","year":"1952","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","article-title":"On free monoids partially ordered by embedding","volume":"6","author":"Haines","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB6","doi-asserted-by":"crossref","unstructured":"T. Harju, L. Ilie, On quasi orders of words and the confluence property, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(97)00259-4"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB7","first-page":"326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB8","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB9","article-title":"The theory of well-partially-ordered sets","author":"Kruskal","year":"1954"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","article-title":"The theory of well-quasi-ordering; a frequently discovered concept","volume":"13","author":"Kruskal","year":"1972","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB11","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB12","first-page":"745","article-title":"Decision problems for quasi-uniform events","volume":"XV","author":"Rozenberg","year":"1967","journal-title":"Bull. Acad. Polon. Sci., Ser. sci. math., astr., phys."},{"key":"10.1016\/S0304-3975(98)00036-X_BIB13","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB14","series-title":"Theory of Automata","author":"Salomaa","year":"1969"},{"key":"10.1016\/S0304-3975(98)00036-X_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(78)90156-5","article-title":"Effective constructions in well-partially-ordered free monoids","volume":"21","author":"van Leeuwen","year":"1978","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800036X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800036X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:50:31Z","timestamp":1555375831000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800036X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S030439759800036X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00036-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}