Geodesic

Tome 8 (1996) no. 4

Sommaire

On the automaton model of the learning process
p. 3-10
A variant of the proof of a completeness criterion for functions of $k$-valued logic
p. 11-36
On the synthesis of minimal sources
p. 37-43
О сложности нумеpующих опеpатоpов
p. 44-56
On the coding of discrete figures
p. 57-61
On metric clustering
p. 62-78
On the decidability of the completeness problem for special systems of automata functions
p. 79-91
Estimates for the number of threshold functions
p. 92-107
A lower bound for the complexity of information networks for a partial ordering relation
p. 108-122
Automaton complexity of two-place Boolean bases
p. 123-133
On simple universal mosaic homogeneous structures
p. 134-142
On the reconstruction of the segmentation of dynamic patterns
p. 143-148
On an algebra of images
p. 149-156
Valerii Borisovich Kudryavtsev (on the occasion of his sixtieth birthday)
p. 157-158