乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:02:57Z","timestamp":1648846977891},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11047-019-09773-3","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T10:02:37Z","timestamp":1574676157000},"page":"797-809","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchies and undecidability results for iterative arrays with sparse communication"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9589-5833","authenticated-orcid":false,"given":"Andreas","family":"Malcher","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"key":"9773_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TC.1987.5009449","volume":"C\u201336","author":"JH Chang","year":"1987","unstructured":"Chang JH, Ibarra OH, Palis MA (1987) Parallel parsing on a one-way array of finite-state machines. IEEE Trans Comput C\u201336:64\u201375","journal-title":"IEEE Trans Comput"},{"key":"9773_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C Choffrut","year":"1984","unstructured":"Choffrut C, Culik K II (1984) On real-time cellular automata and trellis automata. Acta Inform 21:393\u2013407","journal-title":"Acta Inform"},{"issue":"4","key":"9773_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C\u201318","author":"SN Cole","year":"1969","unstructured":"Cole SN (1969) Real-time computation by $$n$$-dimensional iterative arrays of finite-state machines. IEEE Trans Comput C\u201318(4):349\u2013365","journal-title":"IEEE Trans Comput"},{"key":"9773_CR4","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"PC Fischer","year":"1965","unstructured":"Fischer PC (1965) Generation of primes by a one-dimensional real-time iterative array. J ACM 12:388\u2013394","journal-title":"J ACM"},{"key":"9773_CR5","first-page":"1","volume-title":"Scientific applications of language methods","author":"M Holzer","year":"2010","unstructured":"Holzer M, Kutrib M (2010) Descriptional complexity\u2014an introductory survey. In: Mart\u00edn-Vide C (ed) Scientific applications of language methods. Imperial College Press, London, pp 1\u201358"},{"key":"9773_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0743-7315(85)90034-6","volume":"2","author":"OH Ibarra","year":"1985","unstructured":"Ibarra OH, Palis MA (1985) Some results concerning linear iterative (systolic) arrays. J Parallel Distrib Comput 2:182\u2013218","journal-title":"J Parallel Distrib Comput"},{"key":"9773_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(88)90163-6","volume":"57","author":"OH Ibarra","year":"1988","unstructured":"Ibarra OH, Palis MA (1988) Two-dimensional iterative arrays: characterizations and applications. Theor Comput Sci 57:47\u201386","journal-title":"Theor Comput Sci"},{"key":"9773_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-78291-9_6","volume-title":"New developments in formal languages and applications, chapter 6","author":"M Kutrib","year":"2008","unstructured":"Kutrib M (2008) Cellular automata\u2014a computational point of view. In: Bel-Enguix G, Jim\u00e9nez-L\u00f3pez MD, Mart\u00edn-Vide C (eds) New developments in formal languages and applications, chapter 6. Springer, Berlin, pp 183\u2013227"},{"key":"9773_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-0-387-30440-3_54","volume-title":"Encyclopedia of complexity and systems science","author":"M Kutrib","year":"2009","unstructured":"Kutrib M (2009) Cellular automata and language theory. In: Meyers RA (ed) Encyclopedia of complexity and systems science. Springer, Berlin, pp 800\u2013823"},{"issue":"2","key":"9773_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129626409000201","volume":"19","author":"M Kutrib","year":"2009","unstructured":"Kutrib M, Malcher A (2009) Computations and decidability of iterative arrays with restricted communication. Parallel Process Lett 19(2):247\u2013264","journal-title":"Parallel Process Lett"},{"key":"9773_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2009.09.015","volume":"252","author":"M Kutrib","year":"2009","unstructured":"Kutrib M, Malcher A (2009) On one-way one-bit $${O}(1)$$-message cellular automata. Electron Notes Theor Comput Sci 252:77\u201391","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"38\u201339","key":"9773_CR12","doi-asserted-by":"publisher","first-page":"3516","DOI":"10.1016\/j.tcs.2010.05.024","volume":"411","author":"M Kutrib","year":"2010","unstructured":"Kutrib M, Malcher A (2010) Cellular automata with sparse communication. Theor Comput Sci 411(38\u201339):3516\u20133526","journal-title":"Theor Comput Sci"},{"issue":"1\/2","key":"9773_CR13","first-page":"135","volume":"15","author":"M Kutrib","year":"2010","unstructured":"Kutrib M, Malcher A (2010) One-way cellular automata, bounded languages, and minimal communication. J Autom Lang Comb 15(1\/2):135\u2013153","journal-title":"J Autom Lang Comb"},{"issue":"30","key":"9773_CR14","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 (2011) Cellular automata with limited inter-cell bandwidth. Theor Comput Sci 412(30):3917\u20133931","journal-title":"Theor Comput Sci"},{"key":"9773_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-73216-9_6","volume-title":"Reversibility and universality, emergence, complexity and computation","author":"M Kutrib","year":"2018","unstructured":"Kutrib M, Malcher A (2018) Cellular automata: descriptional complexity and decidability. In: Adamatzky A (ed) Reversibility and universality, emergence, complexity and computation, vol 30. Springer, Berlin, pp 129\u2013168"},{"key":"9773_CR16","first-page":"721","volume":"E87\u2013D","author":"A Malcher","year":"2004","unstructured":"Malcher A (2004) On the descriptional complexity of iterative arrays. IEICE Trans Inf Syst E87\u2013D:721\u2013725","journal-title":"IEICE Trans Inf Syst"},{"issue":"1","key":"9773_CR17","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 (1999) Signals in one-dimensional cellular automata. Theor Comput Sci 217(1):53\u201380","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9773_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0022-0000(72)80004-7","volume":"6","author":"AR Smith III","year":"1972","unstructured":"Smith AR III (1972) Real-time language recognition by one-dimensional cellular automata. J Comput Syst Sci 6(3):233\u2013253","journal-title":"J Comput Syst Sci"},{"key":"9773_CR19","first-page":"257","volume":"52","author":"H Umeo","year":"2002","unstructured":"Umeo H, Kamikawa N (2002) A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundam Inform 52:257\u2013275","journal-title":"Fundam Inform"},{"key":"9773_CR20","first-page":"421","volume":"58","author":"H Umeo","year":"2003","unstructured":"Umeo H, Kamikawa N (2003) Real-time generation of primes by a 1-bit-communication cellular automaton. Fundam Inform 58:421\u2013435","journal-title":"Fundam Inform"},{"key":"9773_CR21","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/10719839_41","volume-title":"Theoretical informatics (LATIN 2000), LNCS","author":"T Worsch","year":"2000","unstructured":"Worsch T (2000) Linear time language recognition on cellular automata with restricted communication. In: Gonnet GH, Panario D, Viola A (eds) Theoretical informatics (LATIN 2000), LNCS, vol 1776. Springer, Berlin, pp 417\u2013426"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09773-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-019-09773-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09773-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T00:36:57Z","timestamp":1606178217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-019-09773-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["9773"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09773-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}