{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T12:56:27Z","timestamp":1773406587726,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1007\/bf01303058","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T17:50:37Z","timestamp":1111773037000},"page":"245-266","source":"Crossref","is-referenced-by-count":1,"title":["Power of interconnections and of nondeterminism in regularY-tree systolic automata"],"prefix":"10.1007","volume":"28","author":[{"given":"E.","family":"Fachini","sequence":"first","affiliation":[]},{"given":"J.","family":"Gruska","sequence":"additional","affiliation":[]},{"given":"M.","family":"Napoli","sequence":"additional","affiliation":[]},{"given":"D.","family":"Parente","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.3233\/FI-1986-9302","volume":"IX","author":"A. Cerny","year":"1986","unstructured":"A. Cerny, J. Gruska, Modular real-time trellis automata,Fundamenta Informaticae IX:253?282, 1986.","journal-title":"Fundamenta Informaticae"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-9260(88)90019-3","volume":"6","author":"P. Chuavalee","year":"1989","unstructured":"P. Chuavalee, L. N. Bhuyan, VLSI layout of binary structures,Integration of VLSI Journal,6:83?99, 1989.","journal-title":"Integration of VLSI Journal"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289573","volume":"18","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, J. Gruska, A. Salomaa, Systolic automata for VLSI on balanced tree,Acta Informatica 18:335?344, 1983.","journal-title":"Acta Informatica"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(83)90032-4","volume":"23","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, J. Gruska, A. Salomaa, On a family of L languages resulting from systolic tree automata,Theoretical Computer Science 23:231?242, 1983.","journal-title":"Theoretical Computer Science"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/00207168408803410","volume":"15","author":"K. Culik II","year":"1984","unstructured":"K. Culik II, J. Gruska, A. Salomaa, Systolic trellis automata,International Journal Computer Mathematics 15:195?212, 1984, and16:3?22, 1984.","journal-title":"International Journal Computer Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/S0019-9958(86)80011-0","volume":"71","author":"K. Culik II","year":"1986","unstructured":"K. Culik II, J. Gruska, A. Salomaa, Systolic trellis automata: stability, decidability and complexity,Information and Control 71:218?230, 1986.","journal-title":"Information and Control"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/00207168308803390","volume":"14","author":"K. Culik II","year":"1983","unstructured":"K. Culik II, H. J\u00fcrgensen, Programmable finite automata for VLSI,International Journal of Computer Mathematics 14:259?275, 1983.","journal-title":"International Journal of Computer Mathematics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1051\/ita\/1984180100531","volume":"18","author":"K. Culik II","year":"1984","unstructured":"K. Culik II, A. Salomaa, D. Wood, Systolic tree acceptors, RAIROInformatique Th\u00e9orique 18:53?69, 1984.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"CR9","first-page":"144","volume-title":"Proceedings of the 5th Annual Symposium on Computer Architecture","author":"A. Despain","year":"1978","unstructured":"A. Despain, D. Patterson, X-tree: A structured multiprocessor computer architecture, inProceedings of the 5th Annual Symposium on Computer Architecture, pages 144?151. IEEE, New York, 1978."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C. R. Dyer","year":"1980","unstructured":"C. R. Dyer, One way bounded cellular automata,Information and Control 44:261?281, 1980.","journal-title":"Information and Control"},{"issue":"1","key":"CR11","first-page":"53","volume":"8","author":"E. Fachini","year":"1989","unstructured":"E. Fachini, R. Francese, M. Napoli, D. Parente, BC-tree systolic automata: characterization and properties,Computers and Artificial Intelligence 8(1):53?82, 1989.","journal-title":"Computers and Artificial Intelligence"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.3233\/FI-1989-12409","volume":"XII","author":"E. Fachini","year":"1989","unstructured":"E. Fachini, A. Maggiolo Schettini, G. Resta, D. Sangiorgi, Some structural properties of systolic tree automata,Fundamenta Informaticae XII:571?585, 1989.","journal-title":"Fundamenta Informaticae"},{"issue":"6\/7","key":"CR13","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/BF01185564","volume":"29","author":"E. Fachini","year":"1992","unstructured":"E. Fachini, A. Maggiolo Schettini, D. Sangiorgi, Classes ofY-tree systolic automata and systolic trellis automata,Acta Informatica 29(6\/7):623?643, 1992.","journal-title":"Acta Informatica"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"E. Fachini, A. Monti, A Kleene-like characterization of languages accepted by systolic binary tree automata,Journal of Computer and System Science, to appear (1994).","DOI":"10.1016\/S0022-0000(05)80090-X"},{"key":"CR15","unstructured":"E. Fachini, A. Monti, Regular sets, context-free languages and systolicY-tree automata, inProceedings of the 4th Italian Conference of Theoretical Computer Science, pages 199?213. World Scientific 1993."},{"issue":"8","key":"CR16","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1007\/BF01191895","volume":"29","author":"E. Fachini","year":"1992","unstructured":"E. Fachini, A. Monti, M. Napoli, D. Parente, Languages accepted by systolicY-tree automata: structural characterization,Acta Informatica 29(8):761?778, 1992.","journal-title":"Acta Informatica"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(88)90076-X","volume":"56","author":"E. Fachini","year":"1988","unstructured":"E. Fachini, M. Napoli, C-tree systolic automata,Theoretical Computer Science 56:155?186, 1988.","journal-title":"Theoretical Computer Science"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(90)90190-S","volume":"71","author":"J. Gruska","year":"1990","unstructured":"J. Gruska, Synthesis, structure and power of systolic computations,Theoretical Computer Science 71:47?78, 1990.","journal-title":"Theoretical Computer Science"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"O. H. Ibarra","year":"1984","unstructured":"O. H. Ibarra, S. M. Kim, Characterization and computational complexity of systolic trellis automata,Theoretical Computer Science 29:123?153, 1984.","journal-title":"Theoretical Computer Science"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00289240","volume":"21","author":"O. H. Ibarra","year":"1984","unstructured":"O. H. Ibarra, S. M. Kim, A characterization of systolic binary tree automata and applications,Acta Informatica 21:193?207, 1984.","journal-title":"Acta Informatica"},{"issue":"3","key":"CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0129054191000145","volume":"2","author":"A. Monti","year":"1991","unstructured":"A. Monti, D. Parente, Systolic tree with base automata,Internationaljournal of Foundations of Computer Science 2(3):221?235, 1991.","journal-title":"Internationaljournal of Foundations of Computer Science"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303058.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303058\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T11:11:07Z","timestamp":1625656267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["BF01303058"],"URL":"https:\/\/doi.org\/10.1007\/bf01303058","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}