Amanote Research

Amanote Research

    RegisterSign In

Reversibility of Elementary Cellular Automata Under Fully Asynchronous Update

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-06089-7_4
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Biswanath SethiNazim FatèsSukanta Das
Publisher

Springer International Publishing


Related search

Asynchronous Cellular Automata

2018English

Self-Reproduction in Asynchronous Cellular Automata

English

Dynamics of Random Boolean Networks Under Fully Asynchronous Stochastic Update Based on Linear Representation

PLoS ONE
Multidisciplinary
2013English

An Information-Based Classification of Elementary Cellular Automata

Complexity
MultidisciplinaryComputer Science
2017English

On Generative Morphological Diversity of Elementary Cellular Automata

Kybernetes
ControlSystems EngineeringInformation SystemsElectronic EngineeringEngineeringElectricalComputer ScienceTheoretical Computer ScienceSocial SciencesArtificial IntelligenceSoftware
2010English

Reversibility and Quantum Coherence in One-Dimensional Quantum Cellular Automata

Physical Review A
OpticsAtomicMolecular Physics,
2018English

Classification of Elementary Cellular Automata Up to Topological Conjugacy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

A Fully Asynchronous Superscalar Architecture

English

Cellular Automata and GPGPU

International Journal of Grid and High Performance Computing
Computer NetworksCommunications
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy