We show that certain finite groups do not arise as the automorphism group of the square of a finite algebraic structure, nor as the automorphism group of a finite, 2-generated, ...
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Self-similar inverse semigroups are defined using automata theory. Adjacency semigroups of s-resolved Markov partitions of Smale spaces are introduced. It is proved that a Smale s...
: It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this...
Abstract. We study free profinite subgroups of free profinite semigroups of the same rank using, as main tools, iterated implicit operators, subword complexity and the associated e...