Related papers: Classification of groups generated by 3-state auto…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
This paper corrects the characterisation of biautomatic groups presented in Lemma 2.5.5 in the book Word Processing in Groups by Epstein et al. We present a counterexample to the lemma, and we reformulate the lemma to give a valid…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We note that a rational $3$-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational $3$-tangle diagrams up to isotopy. However, there is no perfect classification about rational…
In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cases based on its remainder when divided by three. The…
We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
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…
We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
The automated categorization (or classification) of texts into predefined categories has witnessed a booming interest in the last ten years, due to the increased availability of documents in digital form and the ensuing need to organize…
Grammatical inference consists in learning a language or a grammar from data. In this paper, we consider a number of models for inferring a non-deterministic finite automaton (NFA) with 3 sorts of states, that must accept some words, and…
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…
We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a…
We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.
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 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…