Bounded Automata Groups are co-ET0L

Bishop, A; Elder, M

Bounded Automata Groups are co-ET0L

Bishop, A

Elder, M

Permalink

Publication Type:: Conference Proceeding
Citation:: 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:: 2019-01-01

Closed Access

	Filename	Description	Size
	Bishop-Elder2019_Chapter_BoundedAutomataGroupsAreCo-ET0.pdf	Published version	419.02 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Bishop, A https://orcid.org/0000-0001-6803-1143	en_US
dc.contributor.author	Elder, M https://orcid.org/0000-0002-2438-3945	en_US
dc.date.issued	2019-01-01	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, 11417 LNCS pp. 82 - 94	en_US
dc.identifier.isbn	9783030134341	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131290
dc.description.abstract	© 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP160100486
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-030-13435-8_6	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Bounded Automata Groups are co-ET0L	en_US
dc.type	Conference Proceeding
utslib.citation.volume	11417 LNCS	en_US
utslib.for	0101 Pure Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	11417 LNCS	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/131290