RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Algebra Discrete Math.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Algebra Discrete Math., 2010, Volume 9, Issue 1, Pages 86–102 (Mi adm22)  

This article is cited in 3 scientific papers (total in 3 papers)

RESEARCH ARTICLE

Finite groups as groups of automata with no cycles with exit

Andriy Russyev

Department of Mechanics and Mathematics, Kyiv National Taras Shevchenko University, Volodymyrska, 60, Kyiv 01033

Abstract: Representations of finite groups as automata groups over a binary alphabet are investigated. The subclass of groups of automata with no cycles with exit is studied.

Keywords: automaton, automaton group, finite group, wreath product.

Full text: PDF file (279 kB)

Bibliographic databases:
MSC: 20E08
Received: 22.09.2009
Revised: 18.05.2010
Language:

Citation: Andriy Russyev, “Finite groups as groups of automata with no cycles with exit”, Algebra Discrete Math., 9:1 (2010), 86–102

Citation in format AMSBIB
\Bibitem{Rus10}
\by Andriy Russyev
\paper Finite groups as groups of automata with no cycles with exit
\jour Algebra Discrete Math.
\yr 2010
\vol 9
\issue 1
\pages 86--102
\mathnet{http://mi.mathnet.ru/adm22}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2676714}
\zmath{https://zbmath.org/?q=an:1209.20026}


Linking options:
  • http://mi.mathnet.ru/eng/adm22
  • http://mi.mathnet.ru/eng/adm/v9/i1/p86

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Akhavi A. Klimann I. Lombardy S. Mairesse J. Picantin M., “On the Finiteness Problem for Automaton (Semi) Groups”, Int. J. Algebr. Comput., 22:6 (2012), 1250052  crossref  mathscinet  zmath  isi  elib  scopus
    2. Klimann I., Picantin M., “a Characterization of Those Automata That Structurally Generate Finite Groups”, Latin 2014: Theoretical Informatics, Lecture Notes in Computer Science, 8392, eds. Pardo A., Viola A., Springer-Verlag Berlin, 2014, 180–189  crossref  mathscinet  zmath  isi  scopus
    3. Thiagarajan K. Balasubramanian P. Padmashree J., Proceedings of the 10Th National Conference on Mathematical Techniques and Its Applications (Ncmta 18), Journal of Physics Conference Series, 1000, ed. Govindarajan A. Siva E. Suja K., IOP Publishing Ltd, 2018  crossref  isi  scopus
  • Algebra and Discrete Mathematics
    Number of views:
    This page:100
    Full text:50
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020