Speciality:
01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date:
18.02.1936
E-mail: Keywords: Boolean functions,
finite automata,
random graphs,
enumerative problems,
synthesis of control systems.
Subject:
The asymptotic formulas are presented for the number of strongly connected, source, and initially connected finite automata as well as of functions of the given weigth realizing finite automata. A theorem for hereditary properties is proved. The asymptotic formulas for the number of monotone Boolean functions of $n$ variables are obtained. These formulas are distinct for even and odd $n$.
Main publications:
Korshunov A. D., “O perechislenii konechnykh avtomatov”, Problemy kibernetiki, 34, Nauka, M., 1978, 5–82
Korshunov A. D., “O khromaticheskom chisle $n$-vershinnykh grafov”, Metody disretnogo analiza v teorii bulevykh funktsii, 35, Institut matematiki SO AN SSSR, Novosibirsk, 1980, 15–44
Korshunov A. D., “O chisle monotonnykh bulevykh fkunktsii”, Problemy kibernetiki, 38, Nauka, M., 1981, 5–108
Korshunov A. D., “O slozhnosti kratchaishikh diz'yunktivnykh normalnykh form sluchainykh bulevykh funktsii”, Metody diskretnogo analiza v optimizatsii upravlyayuschikh sistem, 40, Institut matematiki SO AN SSSR, Novosibirsk, 1983, 25–53
Korshunov A. D., “Families of subsets of a finite set and closed classes of Boolean functions”, Extremal problems for finite sets, Bolyai Society Mathematical Studies, 3, Janos Bolyai Mathematical Society, Budapest, 1994, 375–306
