Skip to main content
SpringerLink
Log in
Book cover

Conference on Computability in Europe

CiE 2016: Pursuit of the Universal pp 282–291Cite as

Finitely Generated Semiautomatic Groups

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9709))

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.

S. Jain is supported in part by NUS grants C252-000-087-001, R146-000-181-112 and R146-000-184-112; B. Khoussainov is supported in part by the Marsden Fund grant of the Royal Society of New Zealand; F. Stephan is supported in part by NUS grants R146-000-181-112 and R146-000-184-112.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Berdinsky, D., Khoussainov, B.: On automatic transitive graphs. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 1–12. Springer, Heidelberg (2014)

    Google Scholar 

  2. Case, J., Jain, S., Seah, S., Stephan, F.: Automatic functions, linear time and learning. Logical Meth. Comput. Sci. 9(3), 1–26 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)

    MATH  Google Scholar 

  4. Hodgson, B.R.: Théories décidables par automate fini. Ph.D. thesis, Département de mathématiques et de statistique, Université de Montréal (1976)

    Google Scholar 

  5. Hodgson, B.R.: Décidabilité par automate fini. Annales des sciences mathématiques du Québec 7(1), 39–57 (1983)

    MathSciNet  MATH  Google Scholar 

  6. Jain, S., Khoussainov, B., Stephan, F., Teng, D., Zou, S.: Semiautomatic structures. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.É., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 204–217. Springer, Heidelberg (2014)

    Google Scholar 

  7. Kharlampovich, O., Khoussainov, B., Miasnikov, A.: From automatic structures to automatic groups. Groups Geom. Dyn. Syst. 8(1), 157–198 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Khoussainov, B., Nerode, A.: Logic and computational complexity. In: Leivant, D. (ed.) Automatic Presentations of Structures. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995)

    Google Scholar 

  9. Miasnikov, A., Šunić, Z.: Cayley graph automatic groups are not necessarily Cayley graph biautomatic. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 401–407. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Nies, A.: Describing groups. Bull. Symbolic Logic 13(3), 305–339 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nies, A., Thomas, R.: FA-presentable groups and rings. J. Algebra 320, 569–585 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Šunić, Z., Ventura, E.: The conjugacy problem in automaton groups is not solvable. J. Algebra 364, 148–154 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Singapore, 13 Computing Drive, COM1, Singapore, 117417, Republic of Singapore

    Sanjay Jain & Frank Stephan

  2. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Bakhadyr Khoussainov

  3. Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, S17, Singapore, 119076, Republic of Singapore

    Frank Stephan

Authors
  1. Sanjay Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Stephan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Stephan .

Editor information

Editors and Affiliations

  1. Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  2. Université Paris-Diderot - Paris 7, Paris, France

    Laurent Bienvenu

  3. University of South Florida, Tampa, Florida, USA

    Nataša Jonoska

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Jain, S., Khoussainov, B., Stephan, F. (2016). Finitely Generated Semiautomatic Groups. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds) Pursuit of the Universal. CiE 2016. Lecture Notes in Computer Science(), vol 9709. Springer, Cham. https://doi.org/10.1007/978-3-319-40189-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40189-8_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40188-1

  • Online ISBN: 978-3-319-40189-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation