Abstract We are interested in the subgroup membership problem in groups acting on rooted ‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with letters, form the boundary of the tree. Stabilisers of infinite rays are not finitely generated in general, but if the ray is computable, the membership problem is well‐posed and solvable. The main result of the paper is that, for bounded automata groups, the membership problem in the stabiliser of any ray that is eventually periodic as an infinite word, forms an ET0L language that is constructable. The result is optimal in the sense that, in general, the membership problem for the stabiliser of an infinite ray in a bounded automata group cannot be context‐free. As an application, we give a recursive formula for the associated generating function, also known as the Green function, on the corresponding infinite Schreier graph.
Bishop et al. (Wed,) studied this question.