Bounded Automata Groups are co-ET0L
Bishop, A, Elder, M · UTS ePRESS (University of Technology Sydney) · 2019
© 2019, Springer Nature Switzerland AG. Holt and Röver proved that finitely generated bounded automata groups have indexed co-word problem. Here we sharpen this result to show they are in fact co-ET0L.