Skip to main content
SpringerLink
Log in

Measuring Closeness Between Cayley Automatic Groups and Automatic Groups

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2018)

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

Abstract

In this paper we introduce a way to estimate a level of closeness of Cayley automatic groups to the class of automatic groups using a certain numerical characteristic. We characterize Cayley automatic groups which are not automatic in terms of this numerical characteristic and then study it for the lamplighter group, the Baumslag–Solitar groups and the Heisenberg group.

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

Access this chapter

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

Institutional subscriptions

References

  1. Baumslag, G., Solitar, D.: Some two-generator one-relator non-Hopfian groups. Bull. Am. Math. Soc. 68, 199–201 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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, Cham (2014). https://doi.org/10.1007/978-3-319-09698-8_1

    Google Scholar 

  3. Berdinsky, D., Khoussainov, B.: Cayley automatic representations of wreath products. Int. J. Found. Comput. Sci. 27(2), 147–159 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blachere, S.: Word distance on the discrete Heisenberg group. Colloq. Math. 95(1), 21–36 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Burillo, J., Elder, M.: Metric properties of Baumslag-Solitar groups. Int. J. Algebra Comput. 25(5), 799–811 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cleary, S., Taback, J.: Dead end words in lamplighter groups and other wreath products. Q. J. Math. 56(2), 165–178 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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 Barlett Publishers, Boston (1992)

    MATH  Google Scholar 

  8. Kargapolov, M.I., Merzljakov, J.I.: Fundamentals of the Theory of Groups. Springer, Heidelberg (1979)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367–392. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60178-3_93

    Chapter  Google Scholar 

  11. Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Heidelberg (1977). https://doi.org/10.1007/978-3-642-61896-3

  12. Roe, J.: Lectures on Coarse Geometry. University Lecture Series, vol. 31. American Mathematical Society, Providence (2003)

    Google Scholar 

  13. Vershik, A.: Numerical characteristics of groups and corresponding relations. J. Math. Sci. 107(5), 4147–4156 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors thank the referees for useful comments.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Mahidol University, Bangkok, Thailand

    Dmitry Berdinsky & Phongpitak Trakuldit

  2. Centre of Excellence in Mathematics, Commission on Higher Education, Bangkok, Thailand

    Dmitry Berdinsky & Phongpitak Trakuldit

Authors
  1. Dmitry Berdinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phongpitak Trakuldit
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dmitry Berdinsky .

Editor information

Editors and Affiliations

  1. Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Berdinsky, D., Trakuldit, P. (2018). Measuring Closeness Between Cayley Automatic Groups and Automatic Groups. In: Klein, S., Martín-Vide, C., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science(), vol 10792. Springer, Cham. https://doi.org/10.1007/978-3-319-77313-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77313-1_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77312-4

  • Online ISBN: 978-3-319-77313-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation