Groups with et0l co-word problem
International Journal of Algebra and Computation · 29.07.2026 · 1-21
DOI: 10.1142/s0218196726500487 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Algebra and Computation, online erschienen am 29.07.2026. Verfasst von Raad Al Kohli und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, we study groups whose co-word problems are et0l languages, which we call co-et0l groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder. In particular, we prove a number of closure results for the class of groups with co-word problems in a subclass of “special” et0l languages; that class of groups contains all groups that we know at the time of writing to be co-et0l, including all groups that were proved by Holt and Röver to be stack groups, and hence co-indexed. It includes virtually free groups, bounded automata groups, and the Higman–Thompson groups, together with groups constructed from those using finitely generated subgroups, finite extensions, free and direct products, and by taking the restricted standard wreath product of a co-et0l group by a finitely generated virtually free top group.
Zitieren
APA
Kohli, R. A., Holt, D. F., & Rees, S. (2026). Groups with et0l co-word problem. International Journal of Algebra and Computation, 1-21. https://doi.org/10.1142/s0218196726500487
Vancouver
Kohli RA, Holt DF, Rees S. Groups with et0l co-word problem. International Journal of Algebra and Computation. 2026:1-21. doi:10.1142/s0218196726500487
BibTeX
@article{Kohli2026,
author = {Kohli, Raad Al and Holt, Derek F. and Rees, Sarah},
title = {Groups with et0l co-word problem},
journal = {International Journal of Algebra and Computation},
year = {2026},
pages = {1--21},
doi = {10.1142/s0218196726500487}
}
EUVIMED