Related papers: Extensions of Abelian Automata Groups
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad.…
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 study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
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…
We propose a scheme to construct predictive models for Hamiltonian matrices in atomic orbital representation from ab initio data as a function of atomic and bond environments. The scheme goes beyond conventional tight binding descriptions…
This paper proves the existence of potentials of the first and second kind of a Frobenius like structure in a frame which encompasses families of arrangements. Surprisingly the proof is based on the study of finite sets of vectors in a…
We study central extensions E of elementary abelian 2-groups by elementary abelian 2-groups. Associated to such an extension is a quadratic map which determines the extension uniquely. The components of the map determine a quadratic ideal…
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected $k \times k$ matrix. Only one entry of the…
We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix…
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…
We study the SU(3) extension of the Skyrme model with vector mesons in the collective quantization scheme. The parameters of the model are fixed in its mesonic sector. Fields which are excited by the collective rotation of the classical…
Bayesian additive regression trees (BART) are popular Bayesian ensemble models used in regression and classification analysis. Under this modeling framework, the regression function is approximated by an ensemble of decision trees,…
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…
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…
We show that, for a fairly large class of reversible, one-dimensional cellular automata, the set of additive invariants exhibits an algebraic structure. More precisely, if $f$ and $g$ are one-dimensional, reversible cellular automata of the…
We formulate an algebraic problem to find a generating system of a finite subset of an Abelian group with respect to linear relations whose coefficients are bounded by a constant, and recall MITM algorithm for the problem. As an application…
Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…
Matrix pencils, or pairs of matrices, are used in a variety of applications. By the Kronecker decomposition Theorem, they admit a normal form. This normal form consists of four parts, one part based on the Jordan canonical form, one part…
If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…