000 03497nam a22005415i 4500
001 978-3-030-61588-8
003 DE-He213
005 20240730164546.0
007 cr nn 008mamaa
008 201017s2020 sz | s |||| 0|eng d
020 _a9783030615888
_9978-3-030-61588-8
024 7 _a10.1007/978-3-030-61588-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCellular Automata and Discrete Complex Systems
_h[electronic resource] :
_b26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10-12, 2020, Proceedings /
_cedited by Hector Zenil.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXXV, 153 p. 24 illus., 5 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12286
505 0 _aExploring Millions of 6-State FSSP Solutions: the Formal Notion of Local CA Simulation -- Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures -- Cycle based Clustering using Reversible Cellular Automata -- Commutative automata networks -- Cellular String Generators -- Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata -- Self-Stabilizing Distributed Algorithms by Gellular Automata -- A characterization of amenable groups with Besicovitch pseudodistances -- Four heads are better than three -- Complexity of Generic Limit Sets of Cellular Automata -- Latin Hypercubes and Cellular Automata.
520 _aThis volume constitutes the refereed post-conference proceedings of the 26th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2020, held in Stockholm, Sweden, in August 2020. The workshop was held virtually. The 11 full papers presented in this book were carefully reviewed and selected from a total of 21 submissions. The topics of the conference include dynamical, topological, ergodic and algebraic aspects of CA and DCS, algorithmic and complexity issues, emergent properties, formal languages, symbolic dynamics, tilings, models of parallelism and distributed systems, timing schemes, synchronous versus asynchronous models, phenomenological descriptions, scientific modeling, and practical applications.
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aDatabase management.
_93157
650 1 4 _aTheory of Computation.
_985154
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aDatabase Management.
_93157
700 1 _aZenil, Hector.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_985156
710 2 _aSpringerLink (Online service)
_985157
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030615871
776 0 8 _iPrinted edition:
_z9783030615895
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12286
_985159
856 4 0 _uhttps://doi.org/10.1007/978-3-030-61588-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c85774
_d85774