{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:26:01Z","timestamp":1725517561039},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642333491"},{"type":"electronic","value":"9783642333507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33350-7_5","type":"book-chapter","created":{"date-parts":[[2012,9,20]],"date-time":"2012-09-20T04:36:18Z","timestamp":1348115778000},"page":"42-51","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Arrays: Little Resources Big Size Impact"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Beyer, W.T.: Recognition of topological invariants by iterative arrays. Tech. Rep. TR-66. MIT, Cambridge, Proj. MAC (1969)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44612-5_20","volume-title":"Mathematical Foundations of Computer Science 2000","author":"T. Buchholz","year":"2000","unstructured":"Buchholz, T., Klein, A., Kutrib, M.: Iterative Arrays with Small Time Bounds. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 243\u2013252. Springer, Heidelberg (2000)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with limited nondeterministic communication cell. In: Words, Languages and Combinatorics III, pp. 73\u201387. World Scientific Publishing (2003)","DOI":"10.1142\/9789812704979_0006"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/S0167-8191(97)00075-6","volume":"23","author":"T. Buchholz","year":"1997","unstructured":"Buchholz, T., Kutrib, M.: Some relations between massively parallel arrays. Parallel Comput.\u00a023, 1643\u20131662 (1997)","journal-title":"Parallel Comput."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s002360050123","volume":"35","author":"T. Buchholz","year":"1998","unstructured":"Buchholz, T., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Inform.\u00a035, 329\u2013352 (1998)","journal-title":"Acta Inform."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TC.1987.5009449","volume":"36","author":"J.H. Chang","year":"1987","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A.: Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput. C-36, 64\u201375 (1987)","journal-title":"IEEE Trans. Comput. C-"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"18","author":"S.N. Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C-18, 349\u2013365 (1969)","journal-title":"IEEE Trans. Comput. C-"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"P.C. Fischer","year":"1965","unstructured":"Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. ACM\u00a012, 388\u2013394 (1965)","journal-title":"J. ACM"},{"key":"5_CR9","first-page":"193","volume":"8","author":"J. Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS\u00a08, 193\u2013234 (2002)","journal-title":"J. UCS"},{"key":"5_CR10","first-page":"107","volume":"15","author":"H. Gruber","year":"2010","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: On measuring non-recursive trade-offs. J. Autom., Lang. Comb.\u00a015, 107\u2013120 (2010)","journal-title":"J. Autom., Lang. Comb."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Descriptional complexity \u2013 An introductory survey. In: Scientific Appl. of Language Methods, pp. 1\u201358. Imperial College Press (2010)","DOI":"10.1142\/9781848165458_0001"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1137\/0216072","volume":"16","author":"O.H. Ibarra","year":"1987","unstructured":"Ibarra, O.H., Jiang, T.: On one-way cellular arrays. SIAM J. Comput.\u00a016, 1135\u20131154 (1987)","journal-title":"SIAM J. Comput."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0743-7315(85)90034-6","volume":"2","author":"O.H. Ibarra","year":"1985","unstructured":"Ibarra, O.H., Palis, M.A.: Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput.\u00a02, 182\u2013218 (1985)","journal-title":"J. Parallel Distributed Comput."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(88)90163-6","volume":"57","author":"O.H. Ibarra","year":"1988","unstructured":"Ibarra, O.H., Palis, M.A.: Two-dimensional iterative arrays: Characterizations and applications. Theoret. Comput. Sci.\u00a057, 47\u201386 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054105003406","volume":"16","author":"M. Kutrib","year":"2005","unstructured":"Kutrib, M.: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci.\u00a016, 957\u2013973 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129626409000201","volume":"19","author":"M. Kutrib","year":"2009","unstructured":"Kutrib, M., Malcher, A.: Computations and decidability of iterative arrays with restricted communication. Parallel Process. Lett.\u00a019, 247\u2013264 (2009)","journal-title":"Parallel Process. Lett."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"3917","DOI":"10.1016\/j.tcs.2011.02.026","volume":"412","author":"M. Kutrib","year":"2011","unstructured":"Kutrib, M., Malcher, A.: Cellular automata with limited inter-cell bandwidth. Theoret. Comput. Sci.\u00a0412, 3917\u20133931 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"5_CR18","first-page":"721","volume":"87","author":"A. Malcher","year":"2004","unstructured":"Malcher, A.: On the descriptional complexity of iterative arrays. IEICE Trans. Inf. Syst.\u00a0E87-D(3), 721\u2013725 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1142\/S0129054110007581","volume":"21","author":"A. Malcher","year":"2010","unstructured":"Malcher, A., Mereghetti, C., Palano, B.: Sublinearly space bounded iterative arrays. Int. J. Found. Comput. Sci.\u00a021, 843\u2013858 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(98)00150-9","volume":"217","author":"J. Mazoyer","year":"1999","unstructured":"Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theoret. Comput. Sci.\u00a0217, 53\u201380 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Symposium on Switching and Automata Theory, SWAT 1971, pp. 188\u2013191. IEEE (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/0206035","volume":"6","author":"J.I. Seiferas","year":"1977","unstructured":"Seiferas, J.I.: Linear-time computation by nondeterministic multidimensional iterative arrays. SIAM J. Comput.\u00a06, 487\u2013504 (1977)","journal-title":"SIAM J. Comput."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0022-0000(72)80004-7","volume":"6","author":"A.R. Smith III","year":"1972","unstructured":"Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci.\u00a06, 233\u2013253 (1972)","journal-title":"J. Comput. System Sci."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0019-9958(67)90591-8","volume":"11","author":"R.E. Stearns","year":"1967","unstructured":"Stearns, R.E.: A regularity test for pushdown machines. Inform. Control\u00a011, 323\u2013340 (1967)","journal-title":"Inform. Control"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V. Terrier","year":"1995","unstructured":"Terrier, V.: On real time one-way cellular array. Theoret. Comput. Sci.\u00a0141, 331\u2013335 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321864.321865","volume":"22","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: Regularity and related problems for deterministic pushdown automata. J. ACM\u00a022, 1\u201310 (1975)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33350-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:05:25Z","timestamp":1620115525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33350-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333491","9783642333507"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33350-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}