top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers / / edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers / / edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XV, 149 p. 53 illus.)
Disciplina 511.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Algorithms
Computer simulation
Computer networks
Artificial intelligence—Data processing
Theory of Computation
Computer Modelling
Computer Communication Networks
Data Science
ISBN 3-319-18812-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Complexity 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.
Record Nr. UNISA-996200025903316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Cellular Automata and Discrete Complex Systems : 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers / / edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
Cellular Automata and Discrete Complex Systems : 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers / / edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XV, 149 p. 53 illus.)
Disciplina 511.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Algorithms
Computer simulation
Computer networks
Artificial intelligence—Data processing
Theory of Computation
Computer Modelling
Computer Communication Networks
Data Science
ISBN 3-319-18812-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Complexity 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.
Record Nr. UNINA-9910484379603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui