An order-optimal method for the synthesis of a search operator in a class of automaton circuits of a special form
Diskretnaya Matematika, Tome 15 (2003) no. 1, pp. 131-156
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider a problem of constructing operators of metric closeness in the $n$-dimensional cube in the class of automaton circuits of a special form. We study two characteristics of complexity, the spacial and temporal characteristics (the number of elements of the circuit and the time required for calculations realised by the circuit). We suggest a method of constructing the circuits realising such operators with constant running time and optimal in order number of elements.This research was supported by the Russian Foundation for Basic Research, grant 01–01–00748.
[1] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985 | MR
[2] Kudryavtsev V. B., Podkolzin A. S., Bolotov A. A., Osnovy teorii odnorodnykh struktur, Nauka, Moskva, 1990 | MR
[3] Lupanov O. B., “O sinteze nekotorykh klassov upravlyayuschikh sistem”, Problemy kibernetiki, 10 (1963), 63–97 | MR | Zbl
[4] Ulman Dzh. D., Vychislitelnye aspekty SBIS, Radio i svyaz, Moskva, 1990
[5] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, Moskva, 1979 | MR | Zbl