Efficient exhaustive listings of reversible one dimensional cellular automata
type: Item
instance of: scholarly article
title: Efficient exhaustive listings of reversible one dimensional cellular automata
zbMATH Open document ID: 1071.68065
author: Tim Boykett
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 2110956
zbMATH Keywords: One-dimensional cellular automata
zbMATH Keywords: Exhaustive enumeration
zbMATH Keywords: Orderly algorithm
zbMATH Keywords: Algebraic models
zbMATH Keywords: Graph models
Wikidata QID: Q56621429
describes a project that uses: nauty
describes a project that uses: GAP
describes a project that uses: GRAPE
describes a project that uses: Linda
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.06.007
OpenAlex ID: W2045413404
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Logical Reversibility of Computation
cites work: Q4368951
cites work: Q3549254
cites work: Q4385615
cites work: Products of Points--Some Simple Algebras and their Identities
cites work: Q3688411
cites work: Generative communication in Linda
cites work: \(L\)-groupoids: Algebraic and topological properties of special groupoids
cites work: The structure of reversible one-dimensional cellular automata
cites work: Q4036787
cites work: Reversibility of 2D cellular automata is undecidable
cites work: Notes on central groupoids
cites work: On rational circulants satisfying \(A^2=dI+\lambda J\)
cites work: On some solutions of \(A^k=dI+\lambda J\)
cites work: Q4182896
cites work: Algebraic properties of linear cellular automata
cites work: On rational circulants satisfying \(A^ m=dI+\lambda J\)
cites work: Isomorph-Free Exhaustive Generation
cites work: Idempotent Semigroups
cites work: Q5610934
cites work: Quasilinear cellular automata
cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones
cites work: Extraction of mth roots in matrix rings over fields
cites work: Q4022642
cites work: Parallelism in near-rings
cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
cites work: Tesselations with local transformations
cites work: An orderly algorithm and some applications in finite geometry
cites work: A generalization of the matrix equation \(A^ 2=J\)
cites work: On the existence of finite central groupoids of all possible ranks. I
cites work: Q4273617
cites work: Invertible cellular automata: A review
cites work: Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
cites work: Q4834460
cites work: On the matrix equation \(A^m=\lambda J\)
cites work: On the \(g\)-circulant solutions to the matrix equation \(A^m=\lambda J\)
DOI: 10.1016/J.TCS.2004.06.007
DBLP publication ID: journals/tcs/Boykett04
description: scientific article; zbMATH DE number 2110956