Titlebook: Cellular Automata and Discrete Complex Systems; 21st IFIP WG 1.5 Int Jarkko Kari Conference proceedings 2015 IFIP International Federation

curettage

收集

创造性

Welfare Professions and the LawWe define, as local quantities, the least energy and momentum allowed by quantum mechanics and special relativity for physical realizations of some classical lattice dynamics. These definitions depend on local rates of finite-state change. In two example dynamics, we see that these rates evolve like classical mechanical energy and momentum.

Infuriate

留恋

APO

欢乐东方

Groups and Monoids of Cellular Automata,We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subshifts, countable subshifts and coded and synchronized systems. Both purely group-theoretic properties and issues of decidability are considered.

享乐主义者

健忘症

Group-Walking Automata,In the setting of symbolic dynamics on discrete finitely generated infinite groups, we define a model of multi-headed finite automata that walk on Cayley graphs, and use it to define subshifts. We characterize the torsion groups (also known as periodic groups) as those on which the group-walking automata are strictly weaker than Turing machines.

circuit

Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata,A linear-slender context-free language is a context-free language whose number of words of length . is linear in .. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.