000 03737nam a22006015i 4500
001 978-3-319-92675-9
003 DE-He213
005 20240730182214.0
007 cr nn 008mamaa
008 180524s2018 sz | s |||| 0|eng d
020 _a9783319926759
_9978-3-319-92675-9
024 7 _a10.1007/978-3-319-92675-9
_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] :
_b24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20-22, 2018, Proceedings /
_cedited by Jan M. Baetens, Martin Kutrib.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aIX, 143 p. 38 illus.
_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 ;
_v10875
505 0 _aA Gauge-Invariant Reversible Cellular Automaton -- Counter Machines and Distributed Automata -- Boolean Networks: Beyond Generalized Asynchronicity -- Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14 -- On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata -- Sequentializing Cellular Automata -- Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan's Theorem -- Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication -- Construction of Some Nonautomatic Sequences by Cellular Automata -- Any Shape can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models.
520 _aThis volume constitutes the thoroughly refereed proceedings of the 24th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2018, held in Ghent, Belgium, in June 2018. The 10 regular papers presented in this book were carefully reviewed and selected from a total of 16 submissions. The papers highlight the major advances in the field and the development of new tools, support the development of theory and applications of CA and DCS and identify and study within an inter- and multidisciplinary context, the important fundamental aspects, concepts, notions and problems concerning CA and DCS. .
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9127479
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aNumerical analysis.
_94603
650 1 4 _aTheory of Computation.
_9127480
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9127481
650 2 4 _aMathematical Applications in Computer Science.
_931683
650 2 4 _aNumerical Analysis.
_94603
700 1 _aBaetens, Jan M.
_eeditor.
_0(orcid)
_10000-0003-4084-9992
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127482
700 1 _aKutrib, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127483
710 2 _aSpringerLink (Online service)
_9127484
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319926742
776 0 8 _iPrinted edition:
_z9783319926766
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10875
_9127485
856 4 0 _uhttps://doi.org/10.1007/978-3-319-92675-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91262
_d91262