Related papers: Solitons in 3-State Mealy Automata
Even the fastest SMT solvers have performance problems with regular expressions from real programs. Because these performance issues often arise from the problem representation (e.g. non-deterministic finite automata get determinized and…
Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete…
We study a class of interacting, harmonically trapped boson systems at angular momentum L. The Hamiltonian leaves a L-dimensional subspace invariant, and this permits an explicit solution of several eigenstates and energies for a wide class…
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…
Automaton learning is a domain in which the target system is inferred by the automaton learning algorithm in the form of an automaton, by synthesizing a finite number of inputs and their corresponding outputs. Automaton learning makes use…
We show how to generate robust self-sustained clusters of soliton bullets-spatiotemporal (optical or matter-wave) solitons. The clusters carry an orbital angular momentum being supported by competing nonlinearities. The "atoms" forming the…
The one-mode and the two-mode multiboson systems with sl(2,R) symmetry are investigated.Hamiltonians of these systems are integrated using the theory of orthogonal polynomials. The coherent state representation for these systems is…
We investigate the dynamics of bright matter wave solitons in spin-1 Bose-Einstein condensates with time modulated nonlinearities. We obtain soliton solutions of an integrable autonomous three-coupled Gross-Pitaevskii (3-GP) equations using…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We develop a general framework for the specification and implementation of systems whose executions are words, or partial orders, over an infinite alphabet. As a model of an implementation, we introduce class register automata, a one-way…
We consider a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions (TSSCPPs). These triangles correspond to a ballot process in which…
An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is…
An automaton $\bf A$ is called a retractable automaton if, for every subautomaton $\bf B$ of $\bf A$, there is at least one homomorphism of $\bf A$ onto $\bf B$ which leaves the elements of $B$ fixed (such homomorphism is called a retract…
We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models…
Multiset automata are a class of automata for which the symbols can be read in any order and obtain the same result. We investigate weighted multiset automata and show how to construct them from weighted regular expressions. We present…
We construct the groups $<A,B,C \;| \, A^2,B^2,C^2,(ABC)^2>$ and $<A,B \;| \, A^2,B^4,(AB)^4>$, using 3-state automata over the alphabets $\{1,2,3\}$ and $\{1,2,3,4\}$. In addition, we show, how to define direct powers of $G$ by automaton…
Ultracold gases provide an unprecedented level of control for the investigation of soliton dynamics and collisions. We present a scheme for deterministically preparing pairs of three-component solitons in a Bose-Einstein condensate. Our…
Finitely many two-way automata work independently and synchronously on a unary input. Some of their states are broadcasting, i.e., dispatched to all other automata. At each step of the computation, each automaton changes state and moves…
We present a new approach for the analysis of Bose-Einstein condensates in a few mode approximation. This method has already been used to successfully analyze the vibrational modes in various molecular systems and offers a new perspective…