{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:13:27Z","timestamp":1759335207971},"publisher-location":"London","reference-count":23,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335403"},{"type":"electronic","value":"9781447101291"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4471-0129-1_9","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T14:11:06Z","timestamp":1310998266000},"page":"231-275","source":"Crossref","is-referenced-by-count":12,"title":["Signals on Cellular Automata"],"prefix":"10.1007","author":[{"given":"Marianne","family":"Delorme","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Mazoyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"1","volume":"1","author":"J Albert","year":"1987","unstructured":"Albert J. and \u010culik K. A simple universal cellular automaton and its one-way totalistic version Complex Systems 1 (1987) 1\u201316.","journal-title":"Complex Systems"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R Balzer","year":"1967","unstructured":"Balzer R. An 8-states minimal time solution to the firing squad synchronization problem Information and Control 10 (1967) 22\u201342.","journal-title":"Information and Control"},{"key":"9_CR3","volume-title":"Winning Ways for Your Mathematical Plays. Vol 2","author":"E Berlekamp","year":"1982","unstructured":"Berlekamp E., Conway V., Elwyn R. and Guy R. Winning Ways for Your Mathematical Plays. Vol 2 (Academic Press, 1982)."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1103\/PhysRevA.44.866","volume":"44","author":"N Boccara","year":"1991","unstructured":"Boccara N., Nasser J. and Roger M. Particle-like structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellular-automata rules. Physical Revue A 44 (1991) 866\u2013875.","journal-title":"Physical Revue A"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C Choffrut","year":"1991","unstructured":"Choffrut, C. and \u010culik, K. On real time cellular automata and trellis automata Acta Informaticae 21 (1991) 393\u2013407.","journal-title":"Acta Informaticae"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"C-18","author":"S. Cole","year":"1969","unstructured":"Cole S. Real-time computation by n-dimensional iterative arrays of finite-state machine IEEE Trans. Comput. C-18 (1969) 349\u2013365.","journal-title":"IEEE Trans. Comput"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Delorme M. and Mazoyer J. Reconnaissance parall\u00e8le des langages rationnels sur automates cellulaires plans Theoretical Computer Science (2002)to appear.","DOI":"10.1016\/S0304-3975(02)00016-6"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00330-2","volume":"218","author":"M Delorme","year":"1999","unstructured":"Delorme M., Mazoyer J. and Tougne L. Discrete parabolas and circles on 2D cellular automata. Theoretical Computer Science 218 (1999) 347\u2013417.","journal-title":"Theoretical Computer Science"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Durand B. and R\u00f3ka Zs. The Game of Life: universality revisited. In: M. Delorme and J. Mazoyer (Editors) Cellular Automata: A Parallel Model (Kluwer, 1999) 51\u201376.","DOI":"10.1007\/978-94-015-9153-9_2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/321281.321290","volume":"12","author":"P Fisher","year":"1965","unstructured":"Fisher P. Generation of primes by a one dimensional real time iterative array Journal of the ACM 12 (1965) 388\u2013394.","journal-title":"Journal of the ACM"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-94-015-9153-9_6","volume-title":"Cellular Automata: A Parallel Model","author":"O Ibarra","year":"1999","unstructured":"Ibarra O. Computational complexity of cellular automata: an overview In: M. Delorme and J. Mazoyer (Editors) Cellular Automata: A Parallel Model (Kluwer, 1999) 181\u2013198."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Martin B. A goup interpretation of particles generated by one dimensional cellular automaton, 54 Wolfram\u2019s rule Int. Journ. of Mod. Phys. C. 11\u20131 (2000) 101\u2013123.","DOI":"10.1142\/S0129183100000109"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J Mazoyer","year":"1987","unstructured":"Mazoyer J. A six states minimal time solution to the Firing Squad Synchronization Problem Theoretical Computer Science 50 (1987) 183\u2013238.","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02127801","volume":"16","author":"J Mazoyer","year":"1996","unstructured":"Mazoyer J. Computations on one-dimensional cellular automata Annals of Mathematics and Artificial Intelligence 16 (1996) 285\u2013309.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Mazoyer J. Computations on grids In: M. Delorme and J. Mazoyer (Editors) Cellular Automata: A Parallel Model (Kluwer, 1999) 119\u2013149.","DOI":"10.1007\/978-94-015-9153-9_4"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(98)00125-5","volume":"91","author":"J Mazoyer","year":"1999","unstructured":"Mazoyer J. and Rapaport I. Inducing an order on cellular automata by a grouping operation Discrete Applied Mathematics 91 (1999) 177\u2013196.","journal-title":"Discrete Applied Mathematics"},{"key":"9_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. and Terrier V. Signals in one dimensional cellular automata Theoretical Computer Science 217 (1999) 53\u201380.","journal-title":"Theoretical Computer Science"},{"key":"9_CR18","volume-title":"Algorithms for leader election by cellular automata to appear in Journal of Algorithms","author":"J Mazoyer","year":"2001","unstructured":"Mazoyer J., Nichitiu C. and R\u00e9mila E. Algorithms for leader election by cellular automata to appear in Journal of Algorithms (2001)."},{"key":"9_CR19","series-title":"Research report, 2001-10, LIP, Ecole Normale Sup\u00e9rieure de Lyon","volume-title":"Towards an Algorithmic Classification of Cellular Automata","author":"N Ollinger","year":"2001","unstructured":"Ollinger N. Towards an Algorithmic Classification of Cellular Automata. Research report, 2001\u201310, LIP, Ecole Normale Sup\u00e9rieure de Lyon, 2001."},{"key":"9_CR20","volume-title":"Automates cellulaires sur graphes de Cayley","author":"Zs R\u00f3ka","year":"1994","unstructured":"R\u00f3ka Zs. Automates cellulaires sur graphes de Cayley. Ph.D Thesis, Ecole Normale Sup\u00e9rieure de Lyon, 1994."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/321650.321652","volume":"18","author":"A Smith","year":"1971","unstructured":"Smith A. A simple computation-universal space Journal of ACM 18 (1971) 339\u2013353.","journal-title":"Journal of ACM"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A Waksman","year":"1966","unstructured":"Waksman A. An optimum solution to the firing squad synchronization problem Information and Control 9 (1966) 66\u201378.","journal-title":"Information and Control"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(84)90082-9","volume":"8","author":"S Willson","year":"1984","unstructured":"Willson S. Cellular automata can generate fractals Discrete Applied Mathematics 8 (1984) 91\u201399.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Collision-Based Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0129-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:37:15Z","timestamp":1605677835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0129-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781852335403","9781447101291"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0129-1_9","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}