Geodesic

Sommaire du Fascicule no. 1

The overstructure of a closed class of polynomials modulo $k$
p. 3-15
$\alpha$-closed classes and $\alpha$-complete systems of functions of $k$-valued logic
p. 16-21
A central limit theorem for sums of random variables, any $r$ of which are independent
p. 22-28
Finding probability characteristics of schemes in automaton bases
p. 29-31
The number of functions in some closed classes of a partial $k$-valued logic
p. 32-42
Peculiarities of the realization of boundedly deterministic functions by schemes of unreliable elements
p. 43-59
Decomposable statistics in an inverse occupancy problem
p. 60-73
The number of antichains in ranked partially ordered sets
p. 74-93
The number and cycle structure of solutions of a system of permutation equations
p. 94-104
The number of solutions of some types of systems of Boolean equations
p. 105-116
Distribution of primitive and irreducible polynomials modulo a prime
p. 117-124
Permutations with cycle lengths in a given set
p. 125-134
Reconstruction of an automaton from experiments
p. 135-146
Second All-Union Conference
p. 147-148
On the organization of Soviet Committee of Bernoulli Society

Sommaire du Fascicule no. 2

Vector optimization of decompositions of root trees
p. 3-14
Asymptotic normality of symmetric decomposable statistics in an inhomogeneous scheme
p. 15-27
Minimal rectilinear Steiner trees
p. 28-37
Algorithmic complexity of problems of optimal alphabetical coding for context-free languages
p. 38-51
Approximations of words by words without self-duplication
p. 52-56
Conditions for the asymptotic normality of multidimensional randomized decomposable statistics
p. 57-64
Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic
p. 65-77
Asymptotically exact polynomial algorithms in problems of integer linear programming
p. 78-85
Types of two-place relations and their preservation classes in three-valued logic
p. 86-96
The number of permutations with restrictions on the lengths of cycles
p. 97-109
The number of antichains in multilayered ranked sets
p. 110-128
The number of families of subsets that are closed with respect to intersections
p. 129-136
Dimensions of branches of random $m$-trees
p. 137-142
Asymptotic behavior of the number of solutions of a system of permutation equations
p. 143-154
Packings of balls in Euclidean space, and extremal problems for trigonometric polynomials
p. 155-158
VIII All-Union conference on problems of theoretical cybernetics

Sommaire du Fascicule no. 3

Recursive information converters
p. 3-18
Fundamental directions in the theory of homogeneous structures
p. 19-38
Stability of a solution in a problem on the shortest path on a graph
p. 39-46
Extremal problems for $k$-colored graphs and unimprovable inequalities for pairs of random elements
p. 47-52
An upper bound on the capacity of the boundary of an antichain in an $n$-dimensional cube
p. 53-61
The number of components in a random bipartite graph
p. 62-70
Circuits that allow short unit diagnostic tests
p. 71-76
Self-correction of schemes for some sequences of Boolean functions
p. 77-86
An asymptotic estimate for stratified finite populations
p. 87-95
Finite initial segments of the upper semilattice of finite-automaton degrees
p. 96-103
On the satisfiability fraction for formulas of $k$-valued logic with quantifiers min and max
p. 104-110
Complexity of self-correcting algorithms for two sorting problems
p. 111-120
The structure of a random graph near a critical point
p. 121-128
Matroid decompositions of graphs
p. 129-138
The chromatic dimension of a graph
p. 139-140
The number of relations that determine classes of constants and selector functions of $k$-valued logic
p. 141-144

Sommaire du Fascicule no. 4

Realization of systems of conjunctions by means of switching circuits
p. 3-11
Upper bounds on finite-automaton complexity for generalized regular expressions in a one-letter alphabet
p. 12-16
Bases of a functional system
p. 17-25
Modeling and decomposition of automata by means of calculators
p. 26-35
The complexity of realizing partial Boolean functions by schemes consisting of functional elements
p. 36-45
Randomized decomposable statistics in a generalized allocation scheme over a countable set of cells
p. 46-62
Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
p. 63-77
Maximal cardinality of the shadow of an antichain
p. 78-85
Completeness of two-place boundedly deterministic functions with respect to superposition
p. 86-91
Asymptotic normality of decomposable statistics from the frequencies of $m$-chains
p. 92-103
Complexity of some problems in editing words
p. 104-112
A multidimensional critical Galton–Watson branching process with final types
p. 113-122
Kerdock's code in cyclic form
p. 123-139
V. A. Emilichev, O. I. Mel'nikov, V. I. Sarvanov, R. I. Tyshkevich