Bounded Automata Groups are co-ET0L

Alex Bishop, Murray Elder

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment