000 03758nam a22005415i 4500
999 _c200434013
_d52225
003 DE-He213
005 20231104114255.0
007 cr nn 008mamaa
008 150514s2015 gw | s |||| 0|eng d
020 _a9783319188126
_z978-3-319-18812-6
024 7 _a10.1007/978-3-319-18812-6
_2doi
040 _aTR-AnTOB
_beng
_cTR-AnTOB
_erda
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
072 7 _aUYZG
_2thema004.0151
_223
245 1 0 _aCellular Automata and Discrete Complex Systems :
_b20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers /
_cedited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aTheoretical Computer Science and General Issues ;
_v8996
505 0 _aComplexity of One-Way Cellular Automata -- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles -- 5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal -- A Universal Cellular Automaton Without Sensitive Subsystems -- Real-Time Reversible One-Way Cellular Automata -- Cycle Equivalence of Finite Dynamical Systems Containing Symmetries -- Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces -- Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results -- Rapaport Language Recognition by Reversible Partitioned Cellular Automata -- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 -- Plane-Walking Automata.
520 _aThis book constitutes revised selected papers from the 20th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2014, held in Himeji, Japan, in July 2014. The 10 regular papers included in this volume were carefully reviewed and selected from a total of 25 submissions. It also contains one invited talk in full paper length.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputer simulation.
650 0 _aComputer Communication Networks.
650 0 _aData structures (Computer scienc.
650 1 4 _aComputation by Abstract Devices.
_0http://scigraph.springernature.com/things/product-market-codes/I16013
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_0http://scigraph.springernature.com/things/product-market-codes/I16021
650 2 4 _aSimulation and Modeling.
_0http://scigraph.springernature.com/things/product-market-codes/I19000
650 2 4 _aComputer Communication Networks.
_0http://scigraph.springernature.com/things/product-market-codes/I13022
650 2 4 _aData Structures.
_0http://scigraph.springernature.com/things/product-market-codes/I15017
700 1 _aIsokawa, Teijiro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aImai, Katsunobu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMatsui, Nobuyuki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPeper, Ferdinand.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aUmeo, Hiroshi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
856 4 0 _3Springer eBooks
_zOnline access link to the resource
_uhttps://doi.org/10.1007/978-3-319-18812-6
942 _2lcc
_cEBK
041 _aeng