Collectives of automata in finitely generated groups
From MaRDI portal
Recommendations
Cites work
- A finite 5-pebble-automaton can search every maze
- scientific article; zbMATH DE number 993463 (Why is no real title available?)
- scientific article; zbMATH DE number 3976344 (Why is no real title available?)
- scientific article; zbMATH DE number 3479158 (Why is no real title available?)
- scientific article; zbMATH DE number 647638 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3099373 (Why is no real title available?)
- Infinite Burnside groups of even exponent
- New estimates of odd exponents of infinite Burnside groups.
- On the minimum universal collectives of automata for plane labyrinths
- Solution of the Burnside problem for exponent six
- Systems of automata in labyrinths
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
Cited in
(3)
This page was built for publication: Collectives of automata in finitely generated groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217263)