Bounded Automata Groups are co-ET0L

Springer International Publishing
Publication Type:
Conference Proceeding
Language and Automata Theory and Applications, 2019, pp. 82 - 94
Issue Date:
Filename Description Size
Bishop-Elder2019_Chapter_BoundedAutomataGroupsAreCo-ET0.pdfPublished version419.02 kB
Adobe PDF
Full metadata record
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.
Please use this identifier to cite or link to this item: