Related papers: Determinism in Multi-Soliton Automata
Models which allow an explicit application to structurally modulated substances are reviewed within the frame of a symmetry-based approach starting from discrete lattice theory. Focus is set on models formulated in terms of local variables…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
In this paper we consider deterministic limits of molecular stochastic systems with finite and infinite degrees of freedom. The method to obtain the deterministic vector field is based on the continuum limit of such microscopic systems…
Many metainterpreters found in the logic programming literature are nondeterministic in the sense that the selection of program clauses is not determined. Examples are the familiar "demo" and "vanilla" metainterpreters. For some…
We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach,…
In this paper we consider the class of lambda-nondeterministic linear automata as a model of the class of linear languages. As usual in other automata models, lambda-moves do not increase the acceptance power. The main contribution of this…
Finite-state models of control systems were proposed by several researchers as a convenient mechanism to synthesize controllers enforcing complex specifications. Most techniques for the construction of such symbolic models have two main…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
It has been observed that certain classical chains admit topologically protected zero-energy modes that are localized on the boundaries. The static features of such localized modes are captured by linearized equations of motion, but the…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…
In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in…
Stochastic realization of the wave function in quantum mechanics, with the inclusion of soliton representation of extended particles, is discussed. The concept of Stochastic Qubits is used for quantum computing modeling.
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…
In this paper, we derive a "hamiltonian formalism" for a wide class of mechanical systems, including classical hamiltonian systems, nonholonomic systems, some classes of servomechanism... This construction strongly relies in the geometry…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
In this report, fundamental educational concepts of linear and non-linear equations and solutions of nonlinear equations from the book High-Temperature Superconductivity: The Nonlinear Mechanism and Tunneling Measurements (Kluwer Academic…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
We study some static multi-soliton configurations in the su(N + 1) Toda models. Such configurations exist for N > 1. We construct explicitly a multi-soliton solution for any N and study conditions for having such solutions. The number of…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…