Simple groups in computational group theory.
Small cancellation theory and automatic groups: Part II.
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.
Some Recent Results on Squarefree Words
Some Recognizable Properties of Solvable Groups.
String Matching And Algorithmic Problems In Free Groups.
Strongly geodesically automatic groups are hyperbolic.
Subgroup separability and conjugacy separability of certain HNN extensions.
Sur le problème des mots des quotients de groupes et produits libres
Sur les conditions de petite simplification qui permettent d'utiliser l'algorithme de Dehn.
Surfaces in Three-Manifolds and Non-Singular Equations in Groups.
Symmetric words in nilpotent groups of class ≤ 3
System of equations in commuting variables for free products of Abelian groups.
Systems of equations over locally p-indicable groups.