Bounded Automata Groups are co-ET0L

Holt and R"over 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.