Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

From MaRDI portal
Publication:2561573

DOI10.1016/S0022-0000(72)80013-8zbMath0263.94019OpenAlexW2000451777WikidataQ55921397 ScholiaQ55921397MaRDI QIDQ2561573

Yale N. Patt, Serafino Amoroso

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(72)80013-8




Related Items (only showing first 100 items - show all)

A survey of cellular automata: types, dynamics, non-uniformity and applicationsCharacterization of reversible intermediate boundary cellular automata\(m\)-asynchronous cellular automata: from fairness to quasi-fairnessGroup structured linear cellular automata over \(Z_ m\)Efficient exhaustive listings of reversible one dimensional cellular automataOn the size of the inverse neighborhoods for one-dimensional reversible cellular automataOn ergodic linear cellular automata over ZmIntrinsic universality of a 1-dimensional reversible Cellular AutomatonInversion of 2D cellular automata: Some complexity resultsPredecessors of cellular automata states. II: Pre-images of finite sequencesRice's theorem for the limit sets of cellular automataThe surjectivity problem for 2D cellular automataA tight linear bound on the synchronization delay of bijective automataGrowing patterns in 1D cellular automataReal-time reversible iterative arraysA Characterization of Cellular Automata Generated by Idempotents on the Full Shift(Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand AutomataInverse rules of ECA with rule number 150On the dynamics of cellular automata induced from a prefix codeUNCONVENTIONAL INVERTIBLE BEHAVIORS IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATAAsynchrony Immune Cellular AutomataTernary reversible number-conserving cellular automata are trivialReversibility problem of multidimensional finite cellular automataModeling and optimization for networked evolutionary games with player exit mechanism: semi-tensor product of matrices methodClasses of Languages Generated by the Kleene Star of a WordCellular automata between sofic tree shiftsLocal rule distributions, language complexity and non-uniform cellular automataAn interconnection of local maps inducing onto global mapsOn computing the entropy of cellular automata.Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata LeverageOn Radius 1 Nontrivial Reversible and Number-Conserving Cellular AutomataOn the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of ViewOn the conjugacy problem of cellular automataOn time-symmetry in cellular automataPattern decomposition for tessellation automataGroups, graphs, languages, automata, games and second-order monadic logicDecidable Properties of 2D Cellular AutomataReversible computing and cellular automata -- a surveyON A CHARACTERIZATION OF CELLULAR AUTOMATA IN TILINGS OF THE HYPERBOLIC PLANEStructure of the invertible CA transformations groupThree research directions in non-uniform cellular automataDistributed Multi-authority Attribute-Based Encryption Using Cellular AutomataThe structure of reversible one-dimensional cellular automataA two-layer representation of four-state reversible number-conserving 2D cellular automataHybrid one-dimensional reversible cellular automata are regularA Random NP-complete problem for inversion of 2D cellular automataCharacterization of sets of limit measures of a cellular automaton iterated on a random configurationFast reversible language recognition using cellular automataNondeterministic cellular automataSPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATAReversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditionsTowards a neighborhood simplification of tile systems: from Moore to quasi-linear dependenciesA closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic ruleSurvey of research in the theory of homogeneous structures and their applicationsSimulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automataBulking II: Classifications of cellular automataPermutive one-way cellular automata and the finiteness problem for automaton groupsIndecomposable local maps of tessellation automataProcedures for calculating reversible one-dimensional cellular automataOn reversibility in cellular automataThe behavioral properties of homogeneous structuresTheory of cellular automata: a surveyOn the structure of the set of reversible cellular automataOn ergodic one-dimensional cellular automataTopological and measure-theoretic properties of one-dimensional cellular automataThe vector string descriptor as a tool in the analysis of cellular automata systemsComputation and construction universality of reversible cellular automataCertain relations between properties of maps of tessellation automataLocal maps inducing surjective global maps of one-dimensional tessellation automataA Cryptosystem Based on the Composition of Reversible Cellular Automata(A-)synchronous (non)-deterministic cell spaces simulating each otherWhen-and how-can a cellular automaton be rewritten as a lattice gas?Characterization of 1-d Periodic Boundary Reversible CADecidability for some problems of linear cellular automata over finite commutative ringsOn the complexity of asynchronous freezing cellular automataInvertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspectsPre-expansivity in cellular automataPERIODIC CONFIGURATIONS OF SUBSHIFTS ON GROUPSLyapunov exponent versus expansivity and sensitivity in cellular automataThe constructibility of a configuration in a cellular automatonON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATASurprising Areas in the Quest for Small Universal DevicesReversibility of non-saturated linear cellular automata on finite triangular gridsSome applications of propositional logic to cellular automataON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHSReversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state setsErgodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)Nonconstructible blocks in 1D cellular automata: minimal generators and natural systemsRecursive paths in cross-connected trees and an application to cell spacesReal-Time Reversible One-Way Cellular AutomataGraph-theoretical characterization of invertible cellular automataReversible space-time simulation of cellular automataCELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTSLinear cellular automata over \(Z_ m\)Decidability and undecidability in cellular automataComputation in reversible cellular automataComputation theoretic aspects of cellular automataReversibility of 2D cellular automata is undecidableClassifying circular cellular automataInvertible cellular automata: A review



Cites Work


This page was built for publication: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures