Let be a group, and let be a finite subset of that generates as a monoid. The co-word problem is the collection of words in the free monoid that represent non-trivial elements of . A current conjecture, based originally on a conjecture of Lehnert and modified into its current form by Bleak, Matucci, and Neuh"{o}ffer, says that Thompson’s group is a universal group with context-free co-word problem. In other words, it is conjectured that a group has a context-free co-word problem exactly if it is a finitely generated subgroup of . Hughes introduced the class of groups that are determined by finite similarity structures. An group acts by local similarities on a compact ultrametric space. Thompson’s group is a representative example, but there are many others. We show that groups have context-free co-word problem under a minimal additional hypothesis. As a result, we can specify a subfamily of groups that are potential counterexamples to the conjecture.

生成讲解博客的中文版本

生成AI智能校验的中文版本