{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:19:49Z","timestamp":1648837189106},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90146-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"219-232","source":"Crossref","is-referenced-by-count":8,"title":["Systolic trees and systolic language recognition by tree automata"],"prefix":"10.1016","volume":"22","author":[{"given":"Magnus","family":"Steinby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90146-9_BIB1","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1137\/0207030","article-title":"Generalized syntax directed translation, tree transducers, and linear space","volume":"7","author":"Baker","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90146-9_BIB2","series-title":"Research Report CS-81-36","article-title":"On a family of L languages resulting from systolic tree automata","author":"Culik","year":"1981"},{"key":"10.1016\/0304-3975(83)90146-9_BIB3","series-title":"Research Report CS-82-01","article-title":"Systolic automata for VLSI on balanced trees","author":"Culik","year":"1982"},{"key":"10.1016\/0304-3975(83)90146-9_BIB4","series-title":"Research Report CS-81-32","article-title":"VLSI systolic trees as acceptors","author":"Culik","year":"1981"},{"key":"10.1016\/0304-3975(83)90146-9_BIB5","series-title":"DAIMI Report FN-10","article-title":"Tree automata and tree grammars","author":"Engelfriet","year":"1975"},{"key":"10.1016\/0304-3975(83)90146-9_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(76)90003-7","article-title":"Surface tree languages and parallel derivation trees","volume":"2","author":"Engelfriet","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90146-9_BIB7_1","first-page":"169","article-title":"A faautomatak algebrai elm\u00e9lete I\u2013II","volume":"26","author":"G\u00e9cseg","year":"1978","journal-title":"Matem. Lapok"},{"key":"10.1016\/0304-3975(83)90146-9_BIB7_2","first-page":"283","article-title":"A faautomatak algebrai elm\u00e9lete I\u2013II","volume":"27","author":"G\u00e9cseg","year":"1979","journal-title":"Matem. Lapok"},{"key":"10.1016\/0304-3975(83)90146-9_BIB8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(83)90146-9_BIB9","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(83)90146-9_BIB10","series-title":"Proc. 2\u00e9me Colloquium sur les Arbres en Alg\u00e9bre et en Programmation","first-page":"235","article-title":"On the structure and realizations of tree automata","author":"Steinby","year":"1977"},{"key":"10.1016\/0304-3975(83)90146-9_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90146-9_BIB12","series-title":"Currents in the Theory of Computation","first-page":"143","article-title":"Tree automata: an informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/0304-3975(83)90146-9_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:27:27Z","timestamp":1555126047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583901469"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90146-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}