Geodesic
On Finite State Automation of 4 Stones which Makes the
Matematičeskoe obrazovanie, Tome 77 (2016) no. 1, pp. 23-43.

Voir la notice de l'article provenant de la source Math-Net.Ru

A finite state automation of 4 stones is constructed to make the round of $\mathbb{Z}^k$ for a polynomial time. Some estimates of the optimal number of stones are discussed.
Keywords: The state machine, stone, crawling $k$-dimensional space, polynomial time visiting points. 
@article{MO_2016_77_1_a4,
     author = {D. V. Gusev},
     title = {On {Finite} {State} {Automation} of 4 {Stones} which {Makes} the},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {23--43},
     publisher = {mathdoc},
     volume = {77},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2016_77_1_a4/}
}
TY  - JOUR
AU  - D. V. Gusev
TI  - On Finite State Automation of 4 Stones which Makes the
JO  - Matematičeskoe obrazovanie
PY  - 2016
SP  - 23
EP  - 43
VL  - 77
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MO_2016_77_1_a4/
LA  - ru
ID  - MO_2016_77_1_a4
ER  - 
%0 Journal Article
%A D. V. Gusev
%T On Finite State Automation of 4 Stones which Makes the
%J Matematičeskoe obrazovanie
%D 2016
%P 23-43
%V 77
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MO_2016_77_1_a4/
%G ru
%F MO_2016_77_1_a4
D. V. Gusev. On Finite State Automation of 4 Stones which Makes the. Matematičeskoe obrazovanie, Tome 77 (2016) no. 1, pp. 23-43. http://geodesic.mathdoc.fr/item/MO_2016_77_1_a4/

[1] Kudryavtsev V.B., Aleshin S.V., Podkolzin A.S., Vedenie v teoriyu avtomatov, Nauka, M., 1985, 320 pp. <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=837853'>837853</ext-link>

[2] Budach L., “Automata and labyrinths”, Mathematische Nachrichten, 1978 <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=532786'>532786</ext-link>

[3] 16-ya letnyaya konferentsiya mezhdunarodnogo matematicheskogo Turnira gorodov <ext-link ext-link-type='uri' href='http://www.turgor.ru/lktg/2004/avtom.ru/ru.ps'>http://www.turgor.ru/lktg/2004/avtom.ru/ru.ps</ext-link>

[4] Counter machine, <ext-link ext-link-type='uri' href='http://en.wikipedia.org/wiki/Counter_machine'>http://en.wikipedia.org/wiki/Counter_machine</ext-link>

[5] Gray F., Pulse code communication, U.S. Patent 2,632,058, 1953

[6] Hilbert D., “Uber die stetige Abbildung einer Linie auf ein Flachenstuck”, Mathematische Annalen, 1891

[7] Peano G., “Sur une courbe, qui remplit toute une aire plane”, Mathematische Annalen, 1890

[8] Butz A.R., “Convergence with Hilbert's space-filling curve”, Journal of Computer and System Sciences, 1969 <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=246631'>246631</ext-link>