{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T14:05:08Z","timestamp":1744812308438},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1968,1,1]],"date-time":"1968-01-01T00:00:00Z","timestamp":-63158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":16635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1968,1]]},"DOI":"10.1016\/s0019-9958(68)90178-2","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"27-54","source":"Crossref","is-referenced-by-count":44,"title":["Some remarks on derivations in general rewriting systems"],"prefix":"10.1016","volume":"12","author":[{"given":"T.V.","family":"Griffiths","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(68)90178-2_bib1","series-title":"Mathematical Linguistics and Automatic Translation","article-title":"Right-to-Left Parsing Using a Predictive Grammar","author":"Abbott","year":"1964"},{"key":"10.1016\/S0019-9958(68)90178-2_bib2","article-title":"Formal properties of grammars","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0019-9958(68)90178-2_bib3","series-title":"Computer Programming and Formal Systems","article-title":"The algebraic theory of context-free grammars","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0019-9958(68)90178-2_bib4","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/S0019-9958(68)90178-2_bib5","first-page":"289","article-title":"On the relative efficiencies of context-free grammar recognizers","volume":"8","author":"Griffiths","year":"1965","journal-title":"Communications Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(68)90178-2_bib6","first-page":"594","article-title":"On procedures for constructing structural descriptions for three parsing algorithms","volume":"8","author":"Griffiths","year":"1965","journal-title":"Communications Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(68)90178-2_bib7","series-title":"The Equivalence of Context Limited Grammars to Context Free Grammars","author":"Hibbard","year":"1967"},{"key":"10.1016\/S0019-9958(68)90178-2_bib8","series-title":"paper, 1964 Ann. Mtg., Association for Machine Translation and Computational Linguistics","article-title":"A General Procedure for Rewriting Strings","author":"Kay","year":"1964"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868901782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868901782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:53:01Z","timestamp":1548928381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995868901782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1968,1]]}},"alternative-id":["S0019995868901782"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(68)90178-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1968,1]]}}}