{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:16:44Z","timestamp":1649042204197},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":[[1982,3]]},"DOI":"10.1007\/bf02254847","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T21:33:57Z","timestamp":1132695237000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Tree acceptors and grammar forms"],"prefix":"10.1007","volume":"29","author":[{"given":"S.","family":"Ginsburg","sequence":"first","affiliation":[]},{"given":"O.","family":"Mayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02254847_CR1","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"[D] Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences4, 406\u2013451 (1970).","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02254847_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01776576","volume":"12","author":"S. Ginsburg","year":"1979","unstructured":"[GLMW] Ginsburg, S., Leong, B., Mayer, O., Wotschke, D.: Strict interpretations of grammar forms. Math. Systems Theory12, 233\u2013252 (1979).","journal-title":"Math. Systems Theory"},{"key":"BF02254847_CR3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"[GS] Ginsburg, S., Spanier E. H.: Derivation-bounded languages. Journal of Computer and System Sciences2, 228\u2013250 (1968).","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02254847_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"[T] Thatcher, J. W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and Systems Sciences1, 317\u2013322 (1967).","journal-title":"Journal of Computer and Systems Sciences"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254847.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02254847\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:52:37Z","timestamp":1558018357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02254847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02254847"],"URL":"https:\/\/doi.org\/10.1007\/bf02254847","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}