scientific article; zbMATH DE number 21231
From MaRDI portal
Publication:3980261
zbMATH Open0764.68100MaRDI QIDQ3980261FDOQ3980261
Authors: K. Sutner 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Cited In (35)
- Reversibility of non-saturated linear cellular automata on finite triangular grids
- Remarks on applications of de Bruijn diagrams and their fragments
- The size of power automata.
- Computing the periods of preimages in surjective cellular automata
- Inversion of 2D cellular automata: Some complexity results
- Local rule distributions, language complexity and non-uniform cellular automata
- Some applications of propositional logic to cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Cellular automata based S-boxes
- Characterization of CA rules for SACA targeting detection of faulty nodes in WSN
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Real linear automata with a continuum of periodic solutions for every period
- Theory of cellular automata: a survey
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- Unitarity plus causality implies localizability
- Inversion of Mutually Orthogonal Cellular Automata
- Characterization of single cycle CA and its application in pattern classification
- Three research directions in non-uniform cellular automata
- Algorithms for computing preimages of cellular automata configurations
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram
- Complexity of reachability problems for finite discrete dynamical systems
- De Bruijn digraphs and affine transformations
- Cellular non-deterministic automata and partial differential equations
- A Survey of the Game “Lights Out!”
- Title not available (Why is that?)
- Linear algebra based bounds for one-dimensional cellular automata
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Inferring the Limit Behavior of Some Elementary Cellular Automata
- A tight linear bound on the synchronization delay of bijective automata
- A Random NP-complete problem for inversion of 2D cellular automata
- Ternary reversible number-conserving cellular automata are trivial
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980261)
