{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:46Z","timestamp":1760202466593},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"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":[[1996,8]]},"DOI":"10.1016\/0304-3975(96)00244-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"277-281","source":"Crossref","is-referenced-by-count":22,"title":["A shrinking lemma for indexed languages"],"prefix":"10.1016","volume":"163","author":[{"given":"Robert H.","family":"Gilman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00244-7_BIB1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars \u2014 an extension of context-free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(96)00244-7_BIB2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","article-title":"Nested stack automata","volume":"16","author":"Aho","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(96)00244-7_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2977\/prims\/1195192738","article-title":"On derivation trees of indexed grammars: an extension of the uvwxy-theorem","volume":"9","author":"Hayashi","year":"1973","journal-title":"Publ. RIMS Kyoto Univ."},{"key":"10.1016\/0304-3975(96)00244-7_BIB4","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(96)00244-7_BIB5","series-title":"Proc. 1st Annual ACM Symp. on the Theory of Computing","first-page":"31","article-title":"Intercalation theorems for stack languages","author":"Ogden","year":"1969"},{"key":"10.1016\/0304-3975(96)00244-7_BIB6","series-title":"Combinatorics on Words","first-page":"105","article-title":"Subwords","volume":"Vol. 17","author":"Sakarovitch","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596002447?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596002447?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:54:00Z","timestamp":1555404840000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596002447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397596002447"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00244-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}