Bounded Automata Groups are co-ET0L

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, 11417 LNCS pp. 82 - 94
Issue Date:
Filename Description Size
Bishop-Elder2019_Chapter_BoundedAutomataGroupsAreCo-ET0.pdfPublished version419.02 kB
Adobe PDF
Full metadata record
© 2019, Springer Nature Switzerland AG. 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.
Please use this identifier to cite or link to this item: