Three research directions in non-uniform cellular automata

DOI10.1016/J.TCS.2014.06.046zbMATH Open1360.68611OpenAlexW1964135527MaRDI QIDQ475396FDOQ475396

Alberto Dennunzio, Julien Provillard, Enrico Formenti

Publication date: 26 November 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.046

Recommendations

• Non-uniform cellular automata: classes, dynamics, and decidability
• Non-uniform cellular automata
• Non-uniform Cellular Automata
• Realization problems for nonuniform cellular automata
• A study of chaos in non-uniform cellular automata
• scientific article; zbMATH DE number 1886334
• On invertible three neighborhood null-boundary uniform cellular automata
• On invertible three neighborhood null-boundary uniform cellular automata
• Progress, gaps and obstacles in the classification of cellular automata
• scientific article

zbMATH Keywords

structural stabilitysymbolic dynamicsdecidability\(\zeta\)-rational languagesnon-uniform cellular automata

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• Title not available (Why is that?)
• Some properties of cellular automata with equicontinuity points
• Languages, equicontinuity and attractors in cellular automata
• Title not available (Why is that?)
• On the directional dynamics of additive cellular automata
• Solution of some conjectures about topological properties of linear cellular automata
• Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• A Survey on m-Asynchronous Cellular Automata
• From one-dimensional to two-dimensional cellular automata
• Title not available (Why is that?)
• Non-uniform Cellular Automata
• Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
• Local rule distributions, language complexity and non-uniform cellular automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Issues of Asynchronous CA
• Title not available (Why is that?)
• Non-uniform cellular automata: classes, dynamics, and decidability
• Conservation of some dynamical properties for operations on cellular automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• The origins of combinatorics on words
• Title not available (Why is that?)
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• On topological dynamics of Turing machines
• Title not available (Why is that?)
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
• Title not available (Why is that?)
• Number-conserving cellular automata I: Decidability.
• Title not available (Why is that?)
• Developments in Language Theory
• Reliable computation with cellular automata
• On the hierarchy of conservation laws in a cellular automaton
• Acceptance Conditions for ω-Languages
• Rekursive Folgenmengen I

Cited In (12)

• Nilpotency and periodic points in non-uniform cellular automata
• Dynamical behavior of additive cellular automata over finite abelian groups
• An efficiently computable characterization of stability and instability for linear cellular automata
• Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
• A comprehensive taxonomy of cellular automata
• Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
• Non-uniform Cellular Automata
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
• On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata

This page was built for publication: Three research directions in non-uniform cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475396)