Related papers: The Holonomy Decomposition of Circular Semi-Flower…
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…
In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…
It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular…
We address the decay in open chaotic quantum systems and calculate semiclassical corrections to the classical exponential decay. We confirm random matrix predictions and, going beyond, calculate Ehrenfest time effects. To support our…
In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…
We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…
We study the connection between small-overlap conditions and automaticity of semigroups. We restrict the discussion to conditions that imply embeddability and under which each relation decomposes into at least seven pieces. For these…
In this note we settle some technical questions concerning finite rank quasi-free Hilbert modules and develop some useful machinery. In particular, we provide a method for determining when two such modules are unitarily equivalent. Along…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…
A canonical Hamiltonian formalism is derived for a class of Ermakov systems specified by several different frequency functions. This class of systems comprises all known cases of Hamiltonian Ermakov systems and can always be reduced to…
Functional decomposition is a powerful tool for systems analysis because it can reduce a function of arbitrary input dimensions to the sum and superposition of functions of a single variable, thereby mitigating (or potentially avoiding) the…
Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…
Nonholonomic mechanical systems have been attracting more interest in recent years because of their rich geometric properties and their applications in Engineering. In all generality, we discuss the reduction of a Hamilton-Jacobi theory for…
Elementary cellular automata are the simplest form of cellular automata, studied extensively by Wolfram in the 1980s. He discovered complex behavior in some of these automata and developed a classification for all cellular automata based on…
Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…
We investigate the semiclassical mechanism of tunneling process in non-integrable systems. The significant role of complex-phase-space chaos in the description of the tunneling process is elucidated by studying a simple scattering map…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
Manifolds with exceptional holonomy play an important role in string theory, supergravity and M-theory. It is explained how one can find the holonomy algebra of an arbitrary Riemannian or Lorentzian manifold. Using the de~Rham and Wu…