Bounded Automata Groups are co-ET0L
Group Theory
2020-12-15 v1 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1811.10157,
title = {Bounded Automata Groups are co-ET0L},
author = {Alex Bishop and Murray Elder},
journal= {arXiv preprint arXiv:1811.10157},
year = {2020}
}