{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T17:24:40Z","timestamp":1694107480268},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1007\/bf02253054","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:21:59Z","timestamp":1132071719000},"page":"213-220","source":"Crossref","is-referenced-by-count":8,"title":["On the generative capacity of tree controlled grammars"],"prefix":"10.1007","volume":"21","author":[{"given":"Gh.","family":"Paun","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02253054_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. Inform. Contr.11, 561\u2013568 (1968).","journal-title":"Inform. Contr."},{"key":"BF02253054_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02252350","volume":"19","author":"K. Culik II","year":"1977","unstructured":"Culik, K. II, Maurer, H. A.: Tree controlled grammars. Computing19, 129\u2013139 (1977).","journal-title":"Computing"},{"key":"BF02253054_CR3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(73)90627-X","volume":"23","author":"H. A. Maurer","year":"1973","unstructured":"Maurer, H. A.: Simple matrix languages with a leftmost restriction. Inform. Contr.23, 128\u2013139 (1973).","journal-title":"Inform. Contr."},{"key":"BF02253054_CR4","doi-asserted-by":"crossref","unstructured":"Paun, Gh.: On the family of finite index matrix languages. Journal of Computer and System Sciences. (In press.)","DOI":"10.1016\/0022-0000(79)90035-7"},{"key":"BF02253054_CR5","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. New York-London: Academic Press 1973."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253054\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:52:20Z","timestamp":1558018340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["BF02253054"],"URL":"https:\/\/doi.org\/10.1007\/bf02253054","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}