{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:04:53Z","timestamp":1648544693011},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"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":12647,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1978,12]]},"DOI":"10.1016\/0022-0000(78)90012-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"319-330","source":"Crossref","is-referenced-by-count":6,"title":["Pumping lemmas for term languages"],"prefix":"10.1016","volume":"17","author":[{"given":"T.S.E.","family":"Maibaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90012-0_BIB1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90012-0_BIB2","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars\u2014an extension of context free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90012-0_BIB3","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik Sprachwiss. Kommunikat."},{"key":"10.1016\/0022-0000(78)90012-0_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90012-0_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2977\/prims\/1195192738","article-title":"On derivation trees of indexed grammars","volume":"9","author":"Hayashi","year":"1973","journal-title":"Publ. RIMS Kyoto Univ."},{"key":"10.1016\/0022-0000(78)90012-0_BIB6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0022-0000(74)80031-0","article-title":"A generalized approach to formal languages","volume":"8","author":"Maibaum","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0022-0000(78)90012-0_BIB7","unstructured":"T.S.E. Maibaum and J. Opatrn\u00fd, Generalised indexed grammars and indexed term grammars, in preparation."},{"key":"10.1016\/0022-0000(78)90012-0_BIB8","series-title":"Automata Studies","first-page":"129","article-title":"Gedanken experiments on sequential machines","author":"Moore","year":"1956"},{"key":"10.1016\/0022-0000(78)90012-0_BIB9","series-title":"Proc. ACM Symp. on Theory of Computing","article-title":"Intercalation theorems for stack automata","author":"Ogden","year":"1968"},{"key":"10.1016\/0022-0000(78)90012-0_BIB10","series-title":"Proc. 3rd ACM Symp. on Theory of Computing","article-title":"Tree-oriented proofs of some theorems on context-free and indexed languages","author":"Rounds","year":"1970"},{"key":"10.1016\/0022-0000(78)90012-0_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machines","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0022-0000(78)90012-0_BIB12","unstructured":"J.W. Thatcher, Private communication, 1972."},{"key":"10.1016\/0022-0000(78)90012-0_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Syst. Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:28:42Z","timestamp":1550323722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["0022000078900120"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90012-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}