Related papers: Groups generated by 3-state automata over a 2-lett…
Several questions about the Galois group of field generated by certain one dimensional formal group laws are studied. This is continuation of author's prior article titled 'Field Generated by Division Points of Certain Formal Group Laws -…
We define a 3-loop group $\Omega^3G$ as a subgroup of smooth maps from a 3-ball to a Lie group $G$, and then construct a 2-group based on an automorphic action on the Mickelsson-Faddeev extension of $\Omega^3G$. In this we follow the…
The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are…
We investigate the language classes recognized by group automata over matrix groups. For the case of $2 \times 2 $ matrices, we prove that the corresponding group automata for rational matrix groups are more powerful than the corresponding…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…
This is a paper in Analytic Topology.
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
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…
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
In this note we show that the known relation between double groupoids and matched pairs of groups may be extended, or seems to extend, to the triple case. The references give some other occurrences of double groupoids.
Box--ball systems (BBS) are integrable systems with soliton solutions and other good properties. We will search for automata that belong to the same class as BBS automata by introducing some classes of automata through the features of BBS…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…
Shephard groups are common extensions of Artin and Coxeter groups. They appear, for example, in algebraic study of manifolds. An infinite family of Shephard groups which are not Artin or Coxeter groups is considered. Using techniques form…
We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.
A set of invariants for a finite group is described. These arise naturally from Frobenius' early work on the group determinant and provide an answer to a question of Brauer. Whereas it is well known that the ordinary character table of a…
We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…