Geodesic

Tome 1 (1989) no. 4

Sommaire

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