Related papers: Algebraic Elimination of epsilon-transitions
In this paper we determine all the Rota-Baxter operators of weight zero on semigroup algebras of order two and three with the help of computer algebra. We determine the matrices for these Rota-Baxter operators by directly solving the…
Quantum-mechanical analysis based on an exact sum rule is used to extract an semiclassical angle-dependent energy function for transition metal ions in biomolecules. The angular dependence is simple but different from existing classical…
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved the pendant of this theorem in a setting with interaction:…
We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…
The representations of a $k$-graph $C^*$-algebra $C^*(\Lambda)$ which arise from $\Lambda$-semibranching function systems are closely linked to the dynamics of the $k$-graph $\Lambda$. In this paper, we undertake a systematic analysis of…
Three elementary canonical transformations are shown both to have quantum implementations as finite transformations and to generate, classically and infinitesimally, the full canonical algebra. A general canonical transformation can, in…
We define quantum bi-Hamiltonian systems, by analogy with the classical case, as derivations in operator algebras which are inner derivations with respect to two compatible associative structures. We find such structures by means of the…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
Let K<x,y> be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K<x,y> are equivalent under an automorphism of…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…
We derive formulas and algorithms for Kitaev's invariants in the periodic table for topological insulators and superconductors for finite disordered systems on lattices with boundaries. We find that K-theory arises as an obstruction to…
Integer lattice gas automata can be utilized as building blocks in statistical mechanics. The presented deterministic and reversible automaton generates semiclassical statistical distributions. A possible approach to Bose-Einstein…
The concept of energy-dependent forces in quantum mechanics is re-analysed. We suggest a simplification of their study via the representation of each self-adjoint and energy-dependent Hamiltonian H=H(E) with real spectrum by an auxiliary…
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…
The generalized h-dependent operator algebra is defined ($0\leq h \leq h_o$). For h= h_o it becomes equivalent to the quantum mechanical algebra of observables and for h=0 it is equivalent to the classical one. We show this by proposing how…
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…
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,…
Looking at the automata defined over a group alphabet as a nearring, we see that they are a highly complicated structure. As with ring theory, one method to deal with complexity is to look at semisimplicity modulo radical structures. We…