Related papers: Groups generated by 3-state automata over a 2-lett…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…
Let us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.
In this note, we complete the classification of extremal doubly even self-dual codes with 2-transitive automorphism groups.
Starting from a Hopf algebra endowed with an action of a group G by Hopf automorphisms, we construct (by a twisted double method) a quasitriangular Hopf G-coalgebra. This method allows us to obtain non-trivial examples of quasitriangular…
We prove that any finite system of interacted automata can not leave some finite arear of Calley graph of periodic group. If group has non-periodic element, then its Calley graph can be explored by some finite automata with 3 pebbles. If…
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…
In this paper, we completely classify three-dimensional Lorentzian $Ein(2)$ Lie groups.
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem…
We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.
This is an extended version of my earlier articel "Projective and injective objects in symmetric categorical groups. arXiv:1007.0121v1." Several new facts added, including the material on the derived 2-functors and the proof of the…
The article is a continuation of the author's work "Linear quasigroups. I" and devoted to linear quasigroups and some of their generalizations. In the second part identities and linearity of quasigroups are investigated, in particular, the…
We determine the structure of 2-blocks with minimal nonabelian defect groups, by making use of the classification of finite simple groups.
The survey contains a brief description of the ideas, constructions, results, and prospects of the theory of hypergroups and generalized translation operators. Representations of hypergroups are considered, being treated as continuous…
This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
The theory of computation is based on abstract computing automata which can be classified into a three-class hierarchy: Finite Automata (FA), Push-down Automata (PDA) and the Turing Machines (TM). Each class corresponds to grammar/language…
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.