11 citations · 12 across the 5 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.GR2024
The word problem and growth of groups
Ievgen Bondarenko
Let denote the word problem in a finitely generated group . We consider the complexity of with respect to standard deterministic Turing machines.…
math.GR2024
The zero divisor conjecture and Mealy automata
Ievgen Bondarenko, Kate Juschenko
The zero divisor conjecture is sufficient to prove for certain class of finitely presented groups where the relations are given by a pairing of generators. We associate Mealy autom…
math.GR2024★ 1 cited
Quaternionic lattices and poly-context-free word problem
Ievgen Bondarenko
A finitely generated group is called poly-context-free if its word problem is an intersection of finitely many context-free languages. We consider the quaterni…