Bounded Automata Groups are co-ET0L
arXiv:1811.10157 · doi:10.1007/978-3-030-13435-8_6
Abstract
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.