Related papers: Determinism in Multi-Soliton Automata
Since the introduction of strong anticipation by D.~Dubois the numerous investigations of concrete systems have been proposed. In proposed paper the new examples of discrete dynamical systems with anticipation are considered. The…
Congruences for stochastic automata are defined, the correspondin factor automata are constructed and investigated for automata ove analytic spaces. We study the behavior under finite and infinite streams. Congruences consist of multiple…
A cellular automaton named Rule 184++C is proposed as a meta-model to investigate the flow of various complex particles. In this model, unlike the granular pipe flow and the traffic flow, not only the free-jam phase transition but also the…
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these…
An analytical model for the soliton-potential interaction is presented, by constructing a collective coordinate for the system. Most of the characters of the interaction are derived analytically while they are calculated by other models…
Automata expressiveness is an essential feature in understanding which of the formalisms available should be chosen for modelling a particular problem. Probabilistic and stochastic automata are suitable for modelling systems exhibiting…
General asymptotic approach to the stability problem of multi-parameter solitons in Hamiltonian systems $i\partial E_n/\partial z=\delta H/\delta E_n^*$ has been developed. It has been shown that asymptotic study of the soliton stability…
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develop a new model of…
Exact analytical soliton solutions play an important role in soliton fields. Soliton solutions were obtained with some special constraints on the nonlinear parameters in nonlinear coupled systems, but they usually do not holds in real…
Autocatalysis is a fundamental concept, used in a wide range of domains. From the most general definition of autocatalysis, that is a process in which a chemical compound is able to catalyze its own formation, several different systems can…
Cellular automata can show well known features of quantum mechanics, such as a linear updating rule that resembles a discretized form of the Schr\"odinger equation together with its conservation laws. Surprisingly, a whole class of…
We consider two models of deterministic active particles in an external potential. In the limit where the speed of a particle is fixed, both models coincide and can be formulated as a Hamiltonian system, but only if the potential is…
Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…
Fungal automata are a nature-inspired computational model, where a rule is alternatively applied verticaly and horizontaly. In this work we study the computational complexity of predicting the dynamics of all fungal freezing totalistic…
A definition of a probabilistic automaton is formulated in which its prime decomposition follows as a direct consequence of Krohn-Rhodes theorem. We first characterize the local structure of probabilistic automata. The prime decomposition…
For a class of one-dimensional cellular automata, we review and complete the characterization of the invariant measures (in particular, all invariant phase separation measures), the rate of convergence to equilibrium, and the derivation of…
An overview is given of basic models combining discreteness in their linear parts (i.e. the models are built as dynamical lattices) and nonlinearity acting at sites of the lattices or between the sites. The considered systems include the…
A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers Z and an indicator function I_A on the interval [0,1]. It is shown that any cellular automaton rule can…
Students find their first course in Formal Languages and Automata Theory challenging. In addition to the development of formal arguments, most students struggle to understand nondeterministic computation models. In part, the struggle stems…
A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…