Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2013_25_1_a4, author = {A. A. Rodin}, title = {The completeness criterion for some systems containing $P$-sets of automaton functions}, journal = {Diskretnaya Matematika}, pages = {76--89}, publisher = {mathdoc}, volume = {25}, number = {1}, year = {2013}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DM_2013_25_1_a4/} }
A. A. Rodin. The completeness criterion for some systems containing $P$-sets of automaton functions. Diskretnaya Matematika, Tome 25 (2013) no. 1, pp. 76-89. http://geodesic.mathdoc.fr/item/DM_2013_25_1_a4/
[1] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985 | MR | Zbl
[2] Kudryavtsev V. B., “O moschnosti mnozhestv predpolnykh mnozhestv nekotoroi funktsionalnoi sistemy, svyazannoi s avtomatami”, Problemy kibernetiki, 13, 1965, 45–74
[3] Rodin A. A., “O kontinualnosti mnozhestva spetsialnykh predpolnykh klassov vo mnozhestve avtomatnykh otobrazhenii”, Intellektualnye sistemy, 16, 2012, 329–334
[4] Alešin S. V., “Über ein Vollständigkeitskriterium für Superpositionen von Automatenabbildungen”, Rostocker Math. Kolloq., 3 (1977), 119–132 | MR | Zbl
[5] Buevich V. A., Usloviya $A$-polnoty dlya konechnykh avtomatov, v. 1–2, Izdatelstvo MGU, Moskva, 1986, 1987
[6] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, Moskva, 1986 | MR