Algebra and Discrete Mathematics
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 and Discrete Mathematics, 2010, Volume 9, Issue 1, Pages 86–102 (Mi adm22)  
This article is cited in 4 scientific papers (total in 4 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
Full-text PDF (279 kB) Citations (4)
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.
Received: 22.09.2009
Revised: 18.05.2010
Bibliographic databases:
Document Type: Article
MSC: 20E08
Language: English
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://mathscinet.ams.org/mathscinet-getitem?mr=2676714}
\zmath{https://zbmath.org/?q=an:1209.20026}
Linking options:
  • https://www.mathnet.ru/eng/adm22
  • https://www.mathnet.ru/eng/adm/v9/i1/p86
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Algebra and Discrete Mathematics
    Statistics & downloads:
    Abstract page:244
    Full-text PDF :102
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024