Cellular Automata and Discrete Complex Systems
-15%
portes grátis
Cellular Automata and Discrete Complex Systems
24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20-22, 2018, Proceedings
Baetens, Jan M.; Kutrib, Martin
Springer International Publishing AG
05/2018
143
Mole
Inglês
9783319926742
15 a 20 dias
454
Descrição não disponível.
A 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Cellular automata;Discrete complex systems;Finite automata;Formal languages;Models of parallelism;Reversibility;Asynchronous models;Topological aspects;Decidability;Sandpile models;Nonautomatic sequences;Artificial intelligence;cellular automata;cellular automaton;theorem proving;numerical methods;formal logic;numerical experiments;computatability;decidability
A 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Cellular automata;Discrete complex systems;Finite automata;Formal languages;Models of parallelism;Reversibility;Asynchronous models;Topological aspects;Decidability;Sandpile models;Nonautomatic sequences;Artificial intelligence;cellular automata;cellular automaton;theorem proving;numerical methods;formal logic;numerical experiments;computatability;decidability
