{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:43:17Z","timestamp":1725482597972},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_41","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T08:13:55Z","timestamp":1176279235000},"page":"417-426","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Linear Time Language Recognition on Cellular Automata with Restricted Communication"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Worsch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"issue":"4","key":"41_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C-18","author":"S.N. Cole","year":"1969","unstructured":"Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers\u00a0C-18(4), 349\u2013365 (1969)","journal-title":"IEEE Transactions on Computers"},{"key":"41_CR2","unstructured":"Mazoyer, J.: A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged. Technical Report TR 89-03, Ecole Normale Sup\u00e9rieure de Lyon, Lyon (1989)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/S0019-9958(71)90501-8","volume":"18","author":"A.R. Smith III","year":"1971","unstructured":"Smith III, A.R.: Cellular automata complexity trade-offs. Information and Control\u00a018, 466\u2013482 (1971)","journal-title":"Information and Control"},{"key":"41_CR4","unstructured":"Umeo, H.: Cellular algorithms with 1-bit inter-cell communications. In: Worsch, T., Vollmar, R. (eds.) MFCS 1998 Satellite Workshop on Cellular Automata, pp. 93\u2013104 (1998)"},{"key":"41_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-86772-8","volume-title":"Modelle der Parallelverarbeitung \u2013 eine Einf\u00fchrung","author":"R. Vollmar","year":"1995","unstructured":"Vollmar, R., Worsch, T.: Modelle der Parallelverarbeitung \u2013 eine Einf\u00fchrung. Teubner, Stuttgart (1995)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T07:38:39Z","timestamp":1567237119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/10719839_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}