Bounded Automata Groups are co-ET0L

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.

References in corpus (2)

• Formal Languages and Infinite Groups
• On groups and counter automata

Cited by in corpus (1)

• The Word Problem for Finitary Automaton Groups