Collectives of automata in finitely generated groups

DOI10.1134/S000143462011005XzbMath1496.68174OpenAlexW3110773599MaRDI QIDQ2217263

D. V. Gusev, Alexei Kanel-Belov, I. A. Ivanov-Pogodaev

Publication date: 29 December 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143462011005x

zbMATH Keywords

finite automataBurnside groupsmaze traversingrobots in mazes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Periodic groups; locally finite groups (20F50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• New estimates of odd exponents of infinite Burnside groups.
• Solution of the Burnside problem for exponent six
• A finite 5-pebble-automaton can search every maze
• THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
• On the minimum universal collectives of automata for plane labyrinths
• Infinite Burnside groups of even exponent
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Collectives of automata in finitely generated groups