Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






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


Matematicheskie Zametki, Forthcoming paper (Mi mzm12282)  

Finite collective of finite automata can not explore the Calley graph of a finitely periodic generated group

A. Ya. Belov
Abstract: It is shown that the Cayley graph of infinite periodic groups cannot be circumvented by any system of finite automata. If there is a non-periodic element such a detour exists. At the same time, a system of one Robot and three stones is enough if aperiodic element exist.
Keywords: Robots in labyrinths, finite automata, periodic groups, Burnside problem.
Funding agency Grant number
Russian Science Foundation 17-11-01377
Received: 10.12.2018
Language: Russian
Linking options:
  • https://www.mathnet.ru/eng/mzm12282
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:150
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025