Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Reshetnyak Yu. G., “O zadache soedineniya elementov vychislitelnoi sistemy”, Vychislitelnye sistemy, 1962, no. 3, 17–32
[2] Reshetnyak Yu. G., “O zadache soedineniya elementov vychislitelnoi sistemy”, Sib. zhurn. industr. matematiki, 7:3(19) (2004), 5–14 | MR | Zbl
[3] Benesh V. E., Matematicheskie osnovy teorii telefonnykh soobschenii, Svyaz, M., 1968
[4] Informatsionnye seti i ikh analiz, Nauka, M., 1978 | MR
[5] Teoriya teletrafika i informatsionnye seti, Nauka, M., 1977 | MR
[6] Ofman Yu. P., “Universalnyi avtomat”, Trudy Mosk. mat. ob-va, 14, 1965, 186–199 | MR | Zbl
[7] Kratko M. I., “Informatsionnye grafy”, Sib. mat. zhurn., 11:5 (1970), 1093–1097 | MR | Zbl
[8] Kratko M. I., “Zamechanie o verkhnei otsenke stepeni informatsionnykh grafov”, Sib. mat. zhurn., 18:5 (1977), 1192–1193 | MR | Zbl
[9] Khillis D. U., “Kommutatsionnaya mashina”, V mire nauki, 1987, no. 8, 60–69