{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:06Z","timestamp":1759638546055},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1970,10,1]],"date-time":"1970-10-01T00:00:00Z","timestamp":23587200000},"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":15630,"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":[[1970,10]]},"DOI":"10.1016\/s0022-0000(70)80045-9","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T10:37:03Z","timestamp":1199356623000},"page":"492-508","source":"Crossref","is-referenced-by-count":60,"title":["An hierarchy between context-free and context-sensitive languages"],"prefix":"10.1016","volume":"4","author":[{"given":"Takumi","family":"Kasai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(70)80045-9_bib1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","article-title":"Programmed grammars and classes of formal languages","volume":"16","author":"Rosenkrantz","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(70)80045-9_bib2","first-page":"61","article-title":"Some questions of phrase structure grammars I","volume":"4","author":"\u00c1brah\u00e1m","year":"1965","journal-title":"Comput. Linguist."},{"key":"10.1016\/S0022-0000(70)80045-9_bib3","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0019-9958(67)90771-1","article-title":"An analog of a theorem about context-free languages","volume":"11","author":"Brainerd","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(70)80045-9_bib4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0022-0000(69)80015-2","article-title":"Scattered context grammars","volume":"3","author":"Greibach","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(70)80045-9_bib5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0019-9958(68)90439-7","article-title":"Grammars with partial ordering of the rules","volume":"12","author":"Fri\u0161","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(70)80045-9_bib6","unstructured":"E. Moriya, State grammars, ordered grammars, and matrix grammars, in preparation."},{"key":"10.1016\/S0022-0000(70)80045-9_bib7","series-title":"Studies in Abstract Families of Languages","first-page":"1","article-title":"Abstract families of languages","volume":"87","author":"Ginsburg","year":"1968"},{"key":"10.1016\/S0022-0000(70)80045-9_bib8","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0022-0000(70)80045-9_bib9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01692513","article-title":"Control sets on grammars","volume":"2","author":"Ginsburg","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(70)80045-9_bib10","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0019-9958(66)80016-5","article-title":"Mapping which preserve context sensitive languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(70)80045-9_bib11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(70)80045-9_bib12","series-title":"Studies in Abstract Families of Languages","first-page":"33","article-title":"Independence of AFL operations","volume":"87","author":"Greibach","year":"1968"},{"key":"10.1016\/S0022-0000(70)80045-9_bib13","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/S0019-9958(64)90406-1","article-title":"A note on asymmetry in phrase structure grammars","volume":"7","author":"Matthews","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(70)80045-9_bib14","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(70)80045-9_bib15","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."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000070800459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000070800459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T18:25:44Z","timestamp":1546367144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000070800459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,10]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1970,10]]}},"alternative-id":["S0022000070800459"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(70)80045-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1970,10]]}}}