{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:29:32Z","timestamp":1691569772796},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0020-0190(90)90136-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"275-276","source":"Crossref","is-referenced-by-count":7,"title":["Tight lower bounds on the length of word chains"],"prefix":"10.1016","volume":"34","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90136-L_BIB1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(87)90031-7","article-title":"On the length of word chains","volume":"26","author":"Berstel","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90136-L_BIB2","article-title":"A new combinational complexity measure for languages","author":"Diwan","year":"1986"},{"key":"10.1016\/0020-0190(90)90136-L_BIB3","first-page":"107","article-title":"Solution to problem number 58","volume":"1","author":"Flye-Sainte Marie","year":"1894","journal-title":"Intermediare Math."},{"key":"10.1016\/0020-0190(90)90136-L_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","article-title":"A survey of full length nonlinear shift register cycle algorithms","volume":"24","author":"Fredricksen","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1016\/0020-0190(90)90136-L_BIB5","author":"Knuth","year":"1969"},{"key":"10.1016\/0020-0190(90)90136-L_BIB6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(89)90167-1","article-title":"A note on word chains and regular languages","volume":"30","author":"Roth","year":"1989","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090136L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090136L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:59:06Z","timestamp":1555088346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090136L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["002001909090136L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90136-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}