{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:29:03Z","timestamp":1778783343088,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90015-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"123-153","source":"Crossref","is-referenced-by-count":59,"title":["Characterizations and computational complexity of systolic trellis automata"],"prefix":"10.1016","volume":"29","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam M.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90015-X_BIB1","first-page":"21","article-title":"Abstract families of deterministic languages","author":"Chandler","year":"1969","journal-title":"Proc. 1st Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(84)90015-X_BIB2","series-title":"Introduction to VLSI Systems","author":"Conway","year":"1980"},{"key":"10.1016\/0304-3975(84)90015-X_BIB3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","article-title":"An observation on time-storage trade-off","volume":"9","author":"Cook","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90015-X_BIB4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0022-0000(76)80048-7","article-title":"Storage requirements for deterministic polynomial time recognizable languages","volume":"13","author":"Cook","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(84)90015-X_BIB5_1","series-title":"Res. Rept. CS-81-34","article-title":"Systolic trellis automata (for VLSI)","author":"Culik","year":"1981"},{"key":"10.1016\/0304-3975(84)90015-X_BIB5_2","unstructured":"Internat. J. Comput. Math., to appear."},{"key":"10.1016\/0304-3975(84)90015-X_BIB6","series-title":"Res. Rept. CS-82-04","article-title":"Systolic trellis automata: Stability, decidability and complexity","author":"Culik","year":"1982"},{"key":"10.1016\/0304-3975(84)90015-X_BIB7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289573","article-title":"Systolic automata for VLSI on balanced trees","volume":"18","author":"Culik","year":"1983","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(84)90015-X_BIB8","series-title":"Res. Rept. CS-81-32","article-title":"VLSI systolic trees as acceptors","author":"Culik","year":"1981"},{"key":"10.1016\/0304-3975(84)90015-X_BIB9","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0304-3975(84)90015-X_BIB10","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(84)90015-X_BIB11","series-title":"Introduction to Automata Theory, Languages, and Computations","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(84)90015-X_BIB12","first-page":"1763","article-title":"An approach to a unified theory of automata","volume":"46","author":"Hopcroft","year":"1967","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(84)90015-X_BIB13","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(84)90015-X_BIB14","first-page":"65","article-title":"Let's design algorithms for VLSI systems","author":"Kung","year":"1979","journal-title":"Proc. Caltech Conf. on Very Large Scale Integration"},{"key":"10.1016\/0304-3975(84)90015-X_BIB15","series-title":"Res. Rept.","article-title":"The structure of parallel algorithms","author":"Kung","year":"1979"},{"key":"10.1016\/0304-3975(84)90015-X_BIB16","series-title":"Proc. Sparse Matrix","first-page":"256","article-title":"Systolic arrays (for VLSI)","author":"Kung","year":"1979"},{"key":"10.1016\/0304-3975(84)90015-X_BIB17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/SFCS.1981.34","article-title":"Optimizing synchronous systems","author":"Leiserson","year":"1981","journal-title":"Proc. 22nd Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(84)90015-X_BIB18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:50:31Z","timestamp":1555113031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758490015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["030439758490015X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90015-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}