English
Related papers

Related papers: Solitons in 3-State Mealy Automata

200 papers

We give the automata which describe time evolution rules of the box-ball system (BBS) with a carrier. It can be shown by use of tropical geometry, such systems are ultradiscrete analogues of KdV equation. We discuss their relation with the…

Spectral Theory · Mathematics 2016-05-04 Tsuyoshi Kato , Satoshi Tsujimoto , Andrzej Zuk

We propose a solitonic dynamical system over finite fields that may be regarded as an analogue of the box-ball systems. The one-soliton solutions of the system, which have nested structures similar to fractals, are also proved. The…

Exactly Solvable and Integrable Systems · Physics 2014-08-04 Fumitaka Yura

We present an algorithm to reduce the coloured box-ball system, a one dimensional integrable cellular automaton described by motions of several colour (kind) of balls, into a simpler monochrome system. This algorithm extracts the colour…

Mathematical Physics · Physics 2009-11-10 Taichiro Takagi

The box-ball system (BBS), introduced by Takahashi and Satsuma in 1990, is a cellular automaton that exhibits solitonic behaviour. In this article, we study the BBS when started from a random two-sided infinite particle configuration. For…

Probability · Mathematics 2026-04-15 David A. Croydon , Tsuyoshi Kato , Makiko Sasada , Satoshi Tsujimoto

A box-ball system is a discrete dynamical system whose dynamics come from the balls jumping according to certain rules. A permutation on n objects gives a box-ball system state by assigning its one-line notation to n consecutive boxes.…

Combinatorics · Mathematics 2023-10-10 Ben Drucker , Eli Garcia , Emily Gunawan , Aubrey Rumbolt , Rose Silver

The $\epsilon$-BBS is the family of solitonic cellular automata obtained via the ultradiscretization of the elementary Toda orbits, which is a parametrized family of integrable systems unifying the Toda equation and the relativistic Toda…

Exactly Solvable and Integrable Systems · Physics 2022-02-21 Katsuki Kobayashi , Satoshi Tsujimoto

This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.

A soliton cellular automaton on a one dimensional semi-infinite lattice with a reflecting end is presented. It extends a box-ball system on an infinite lattice associated with the crystal base of U_q(sl_n). A commuting family of time…

Exactly Solvable and Integrable Systems · Physics 2015-06-26 Atsuo Kuniba , Masato Okado , Yasuhiko Yamada

We construct a hierarchy of integrable systems whose Poisson structure corresponds to the BMS$_{3}$ algebra, and then discuss its description in terms of the Riemannian geometry of locally flat spacetimes in three dimensions. The analysis…

High Energy Physics - Theory · Physics 2018-03-14 Oscar Fuentealba , Javier Matulich , Alfredo Pérez , Miguel Pino , Pablo Rodríguez , David Tempo , Ricardo Troncoso

We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…

Formal Languages and Automata Theory · Computer Science 2022-08-23 David Casas , Mikhail V. Volkov

The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, there are some classes of automata that do not contain such examples. For instance, all infinite Burnside automaton groups in the…

Formal Languages and Automata Theory · Computer Science 2014-09-23 Ines Klimann , Matthieu Picantin , Dmytro Savchuk

We first consider the Hamiltonian formulation of $n=3$ systems in general and show that all dynamical systems in ${\mathbb R}^3$ are bi-Hamiltonian. An algorithm is introduced to obtain Poisson structures of a given dynamical system. We…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 Metin Gurses , Gusein Sh. Guseinov , Kostyantyn Zheltukhin

We present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton.…

Computation and Language · Computer Science 2007-05-23 J. F. J. Laros

In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…

Group Theory · Mathematics 2016-07-27 Adam Woryna

We introduce a new class of soliton-like entities in spinor three component BECs. These entities generalize well known solitons. For special values of coupling constants, the system considered is Completely Integrable and supports $N$…

Quantum Gases · Physics 2014-01-28 Piotr Szankowski , Marek Trippenbach , Eryk Infeld

The box-ball system (BBS), which was introduced by Takahashi and Satsuma in 1990, is a soliton cellular automaton. Its dynamics can be linearized by a few methods, among which the best known is the Kerov-Kirillov-Reschetikhin (KKR)…

Combinatorics · Mathematics 2023-01-03 Matteo Mucciconi , Makiko Sasada , Tomohiro Sasamoto , Hayate Suda

We propose a new type of soliton equation, which is obtained from the generalized discrete BKP equation. The obtained equation admits two types of soliton solutions. The signs of amplitude and velocity of the soliton solution are opposite…

Exactly Solvable and Integrable Systems · Physics 2019-12-09 Hidetomo Nagai , Nobuhiko Shinzawa

Soliton solutions with cylindrical symmetry are investigated within the nonlinear $\sigma $-model disregarding the Skyrme-stabilization term. The solitons are stabilized by quantization of collective breathing mode and collapse in the…

High Energy Physics - Phenomenology · Physics 2007-05-23 N. Chepilko , A. Kobushkin , A. Syamtomov

The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…

Cellular Automata and Lattice Gases · Physics 2026-01-05 Henryk Fukś

We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape. Similarly as in the case of the classical two-way machines, it…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Viliam Geffert , Lubomíra Ištoňová