Related papers: $q$-VFCA: $q$-state Vector-valued Fuzzy Cellular A…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
We show that quantum cellular automata naturally form the degree-zero part of a coarse homology theory. The recent result of Ji and Yang that the space of QCA forms an Omega-spectrum in the sense of algebraic topology is a direct…
The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…
We investigate quantum cellular automata (QCA) on one-dimensional spin systems defined over a subalgebra of the full local operator algebra - the symmetric subalgebra under a finite Abelian group symmetry $G$. For systems where each site…
To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
Herein, we introduce the framework of gauge invariant variables to describe fractional quantum Hall (FQH) states, and prove that the wavefunction can always be represented by a unique holomorphic multi-variable complex function. As a…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We…
We introduce a unified formulation of variational methods for simulating ground state properties of quantum many-body systems. The key feature is a novel variational method over quantum circuits via infinitesimal unitary transformations,…
We introduce QVEC-CCA--an intrinsic evaluation metric for word vector representations based on correlations of learned vectors with features extracted from linguistic resources. We show that QVEC-CCA scores are an effective proxy for a…
In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…
Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a…
Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the…
This paper focuses on the impact of rule representation in Michigan-style Learning Fuzzy-Classifier Systems (LFCSs) on its classification performance. A well-representation of the rules in an LFCS is crucial for improving its performance.…
We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…
In this paper we study $\nu$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $\nu$-CA has some properties. In a first part, we…
This paper is the continuation of our earlier considerations on cellular automata with Toom local rule (TCA) as the alternative to kinetic Ising systems. The arguments for TCA stationary states not being the equilibrium states are found in…
We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings…