{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:40Z","timestamp":1725662920791},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"license":[{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_20","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:56:59Z","timestamp":1330167419000},"page":"198-201","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the generative capacity of the strict global grammars"],"prefix":"10.1007","author":[{"given":"Sorin","family":"Ciobotaru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"Paun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0019-9958(67)90771-1","volume":"11","author":"B. Brainerd","year":"1968","unstructured":"Brainerd B. An analog of a theorem about context free languages. Information and Control 11 (1968), 561\u2013567.","journal-title":"Information and Control"},{"key":"20_CR2","volume-title":"The mathematical theory of context free languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg S. The mathematical theory of context free languages. Mc Graw-Hill Book Company New-York (1966)."},{"key":"20_CR3","unstructured":"Gruska J. Descriptional complexity of context free languages. Proc. of symp. and summ. school. Math. fund of computer sci. High Tatras (1973)."},{"key":"20_CR4","first-page":"32","volume":"2","author":"M. K. Levitina","year":"1972","unstructured":"Levitina M.K. On some grammars with global productions. N.T.I. 2 (1972), 32\u201336 (in russ.)","journal-title":"N.T.I."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","volume":"14","author":"A. Salomaa","year":"1968","unstructured":"Salomaa A. On the index of a context free grammar and language. Information and Control, 14 (1968), 474\u2013477.","journal-title":"Information and Control"},{"key":"20_CR6","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa A. Formal languages. Academic Press New York and London (1973)."}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T07:57:53Z","timestamp":1558252673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]},"assertion":[{"value":"25 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}