000 03115nam a22004575i 4500
001 978-3-540-39270-5
003 DE-He213
005 20160624101943.0
007 cr nn 008mamaa
008 121227s1988 gw | s |||| 0|eng d
020 _a9783540392705
_9978-3-540-39270-5
024 7 _a10.1007/3-540-19444-4
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aAutomata Networks
_h[electronic resource] :
_bLITP Spring School on Theoretical Computer Science Argelès-Village, France, May 12–16, 1986 Proceedings /
_cedited by C. Choffrut.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
300 _aVII, 130 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v316
505 0 _aAn introduction to automata network theory -- Arrays, automata and groups — Some interconnections -- Local maps -- Threshold networks and generalizations -- Computation on finite networks of automata -- Systolic algorithms for path-finding problems -- An overview of the firing squad synchronization problem -- Representation of knowledge and learning on automata networks -- Random Boolean nets and disordered systems.
520 _aThis volume contains the proceedings of the 14th Spring School of the LITP (Laboratoire d`Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held May 12-16, 1986 in Argelès-Village on the French Catalan coast. This meeting was organized by C. Choffrut, M. Nivat, F. Robert, P. Sallé and gathered a hundred participants. The proceedings of the last two Spring Schools have already been published in this series and deal with "Automata on Infinite Words" (LNCS 192) and "Combinators and Functional Programming Languages" (LNCS 242). The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The field chosen this year was the theory of automata networks. Though the content of this book is essentially restricted to computer science aspects of the topic, illustrations were given at the meeting on how the model of cellular automata could be used to solve problems in statistical, fluid and solid state mechanics. Applications to biology with growth models also exist.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aChoffrut, C.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540194446
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v316
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-19444-4
942 _2EBK4618
_cEBK
999 _c33912
_d33912