Finitely generated semiautomatic groups

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The present work shows that Cayley automatic groups are semiautomatic and exhibits some further constructions of semiautomatic groups and in particular shows that every finitely generated group of nilpotency class 3 is semiautomatic.

Cite

CITATION STYLE

APA

Jain, S., Khoussainov, B., & Stephan, F. (2016). Finitely generated semiautomatic groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9709, pp. 282–291). Springer Verlag. https://doi.org/10.1007/978-3-319-40189-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free