{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:52:35Z","timestamp":1649195555386},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1007\/bf00289240","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:22:27Z","timestamp":1096946547000},"page":"193-207","source":"Crossref","is-referenced-by-count":14,"title":["A characterization of systolic binary tree automata and applications"],"prefix":"10.1007","volume":"21","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Sam M.","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Culik, K. II, Salomaa, A., Wood, D.: VLSI systolic trees as acceptors, Research Report CS-81-32, Department of Computer Science, University of Waterloo, 1981"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(83)90032-4","volume":"23","author":"K. Culik II","year":"1983","unstructured":"Culik, K. II, Gruska, J., Salomaa, A.: On a family of L languages resulting from systolic tree automata. Theor. Comput. Sci. 23, 231?242 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289573","volume":"18","author":"K. Culik II","year":"1983","unstructured":"Culik, K. II, Gruska, J., Salomaa, A.: Systolic automata for VLSI on balanced trees. Acta Informat. 18, 335?344 (1983)","journal-title":"Acta Informat."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0304-3975(83)90146-9","volume":"22","author":"M. Steinby","year":"1983","unstructured":"Steinby, M.: Note, Systolic trees and systolic language recognition by tree automata. Theor. Comput. Sci. 22, 219?232 (1983)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289240.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289240\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:45Z","timestamp":1554758085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["BF00289240"],"URL":"https:\/\/doi.org\/10.1007\/bf00289240","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}