| dc.creator |
Stephan, Frank |
|
| dc.creator |
Tien Dat Tran, Tien Dat Tran |
|
| dc.creator |
Jain, Sanjay |
|
| dc.creator |
Moldagaliyev, Birzhan |
|
| dc.date |
2022-08-01T00:00:00Z |
|
| dc.date.accessioned |
2023-01-09T12:08:52Z |
|
| dc.date.available |
2023-01-09T12:08:52Z |
|
| dc.identifier |
dcfa71c0-c978-46b7-9a8b-e03218e0fac7 |
|
| dc.identifier |
10.1007/s00236-022-00423-3 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/dcfa71c0-c978-46b7-9a8b-e03218e0fac7/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/98447 |
|
| dc.description |
This paper investigates presentations of lamplighter groups using computationalmodels from automata theory. The present work shows that if G can be presented such that the full group operation is recognised by a transducer, then the same is true for the lamplighter group G (sic) Z of G. Furthermore, Cayley presentations, where only multiplications with constants are recognised by transducers, are used to study generalised lamplighter groups of the form G (sic) Zd and G (sic) Fd, where Fd is the free group over d generators. Additionally, Zk (sic) Z2 and Zk (sic) Fd are shown to be Cayley tree automatic. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Lamplighter groups and automata |
|
| dc.type |
info:eu-repo/semantics/article |
|