相关论文: Algebraic Elimination of epsilon-transitions

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…

The automaton transformation of infinite words over alphabet $\mathbb F_p=\{0,1,\ldots,p-1\}$, where $p$ is a prime number, coincide with the continuous transformation (with respect to the $p$-adic metric) of a ring $\mathbb Z_p$ of…

We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the…

Before we proposed an algebraic technics for the Hamiltonian approach to the evolution systems of partial differential equations, including systems with constraints. Here we further develop this approach and present the defining system of…

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

Given a star product with separation of variables $\star$ on a pseudo-K\"ahler manifold $M$ and a point $x_0 \in M$, we construct an associative algebra of formal distributions supported at $x_0$. We use this algebra to express the formal…

An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group $\mathbb{Z}/m\mathbb{Z}$. In this paper, we consider simplices appearing in the orbits generated from…

After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…

We are interested in topological and ergodic properties of one dimensional cellular automata. We show that an ergodic cellular automaton cannot have irrational eigenvalues. We show that any cellular automaton with an equicontinuous factor…

We consider a semi-classical completely integrable system defined by a $\hbar$-pseudodifferential operator $\hat{H}$ on the torus $\mathbb{T}^{d}$. In order to study perturbed operators of the form $\hat{H}+\hbar^{\kappa}\hat{K}$, where…

A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…

Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…

We show that the $n$'th digit of the base-$b$ representation of the golden ratio is a finite-state function of the Zeckendorf representation of $b^n$, and hence can be computed by a finite automaton. Similar results can be proven for any…

We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

Energy problems are important in the formal analysis of embedded or autonomous systems. Using recent results on star-continuous Kleene omega-algebras, we show here that energy problems can be solved by algebraic manipulations on the…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its…