Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2012_24_3_a8, author = {A. N. Cherepov}, title = {Approximation of continuous functions by finite automata}, journal = {Diskretnaya Matematika}, pages = {82--89}, publisher = {mathdoc}, volume = {24}, number = {3}, year = {2012}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2012_24_3_a8/} }
A. N. Cherepov. Approximation of continuous functions by finite automata. Diskretnaya Matematika, Tome 24 (2012) no. 3, pp. 82-89. http://geodesic.mathdoc.fr/item/DM_2012_24_3_a8/
[1] Vitushkin A. G., Otsenka slozhnosti zadachi tabulyatsii, Fizmatgiz, Moskva, 1959
[2] Gashkov S. B., “O slozhnosti priblizhennoi realizatsii nepreryvnykh funktsii skhemami i formulami v polinomialnykh i nekotorykh drugikh bazisakh”, Matematicheskie voprosy kibernetiki, 5, 1994, 144–207 | MR | Zbl
[3] Ofman Yu. P., “O priblizhennoi realizatsii nepreryvnykh funktsii na avtomatakh”, Doklady AN SSSR, 152:4 (1963), 823–825 | MR
[4] Cherepov A. N., “Otsenki slozhnosti priblizheniya nepreryvnykh funktsii nekotorykh klassov determinirovannymi funktsiyami s zaderzhkoi”, Trudy 16 Mezhdunarodnoi shkoly-seminara “Sintez i slozhnost upravlyayuschikh sistem”, Mekh.-mat. f-t MGU, Moskva, 2006, 118–122
[5] Cherepov A. N., “O slozhnosti priblizheniya nepreryvnykh funktsii determinirovannymi funktsiyami s zaderzhkoi”, Materialy 9 Mezhdunarodnoi konferentsii “Intellektualnye sistemy i kompyuternye nauki”, Mekh.-mat. f-t MGU, Moskva, 2006, 307–310
[6] Cherepov A. N., “Otsenki slozhnosti priblizheniya nepreryvnykh funktsii nekotorykh klassov determinirovannymi funktsiyami s zaderzhkoi”, Diskretnaya matematika, 20:4 (2008), 147–156 | DOI | MR | Zbl
[7] Cherepov A. N., “O priblizhenii nepreryvnykh funktsii determinirovannymi funktsiyami s zaderzhkoi”, Diskretnaya matematika, 22:1 (2010), 83–103 | DOI | MR | Zbl
[8] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, Moskva, 1979 | MR