{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:32:25Z","timestamp":1720200745763},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90216-6","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T07:31:32Z","timestamp":1060327892000},"page":"137-142","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Une g\u00e9n\u00e9ralisation des th\u00e9or\u00e8mes de Higman et de Simon aux mots infinis"],"prefix":"10.1016","volume":"38","author":[{"given":"A.","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90216-6_BIB1","first-page":"326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952"},{"key":"10.1016\/0304-3975(85)90216-6_BIB2","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. Comput. Theory, Ser. A"},{"key":"10.1016\/0304-3975(85)90216-6_BIB3","article-title":"Combinatorics on words","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(85)90216-6_BIB4","first-page":"33","article-title":"On well quasi-ordering transfinite sequences","volume":"61","author":"Nash-Williams","year":"1965"},{"key":"10.1016\/0304-3975(85)90216-6_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1112\/S0025579300000565","article-title":"Partial well-ordering of sets of vectors","volume":"1","author":"Rado","year":"1954","journal-title":"Mathematika"},{"key":"10.1016\/0304-3975(85)90216-6_BIB6","series-title":"Automata Theory and Formal Languages","first-page":"214","article-title":"Piecewise testable events","volume":"33","author":"Simon","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585902166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:00:21Z","timestamp":1552608021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585902166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":6,"alternative-id":["0304397585902166"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90216-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}