scientific article
From MaRDI portal
Publication:3980261
zbMath0764.68100MaRDI QIDQ3980261
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (30)
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata ⋮ Inversion of 2D cellular automata: Some complexity results ⋮ A tight linear bound on the synchronization delay of bijective automata ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ Cellular non-deterministic automata and partial differential equations ⋮ Ternary reversible number-conserving cellular automata are trivial ⋮ Local rule distributions, language complexity and non-uniform cellular automata ⋮ The size of power automata. ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Inferring the Limit Behavior of Some Elementary Cellular Automata ⋮ Inversion of Mutually Orthogonal Cellular Automata ⋮ Computing the periods of preimages in surjective cellular automata ⋮ Unitarity plus causality implies localizability ⋮ Three research directions in non-uniform cellular automata ⋮ A Random NP-complete problem for inversion of 2D cellular automata ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ Cellular automata based S-boxes ⋮ Intrinsically universal \(n\)-dimensional quantum cellular automata ⋮ Characterization of CA Rules for SACA Targeting Detection of Faulty Nodes in WSN ⋮ Non-uniform cellular automata: classes, dynamics, and decidability ⋮ Theory of cellular automata: a survey ⋮ Linear Algebra Based Bounds for One-Dimensional Cellular Automata ⋮ Characterization of Single Cycle CA and its Application in Pattern Classification ⋮ Real Linear Automata with a Continuum of Periodic Solutions for Every Period ⋮ Reversibility of non-saturated linear cellular automata on finite triangular grids ⋮ Some applications of propositional logic to cellular automata ⋮ Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets ⋮ De Bruijn digraphs and affine transformations ⋮ A Survey of the Game “Lights Out!” ⋮ Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
This page was built for publication:
