Geodesic

Sommaire

Решение 6-й Международной конференции ``Основы теории вычислений'',~FCT--87, Казань,~СССР, 22--26 июня~1987~г.
p. 3-4
Декларация участников Международной конференции~FCT--87
p. 4-6
Mathematical cybernetics at Kazan' State University
p. 6-19
Stepwise bilinear algorithms and recognition of completeness in k-valued logics
p. 19-27
The lattice of the degrees below 0′
p. 27-33
Structural properties of automaton transformations
p. 34-39
Complexity of the realization of cyclic Boolean matrices by gate circuits
p. 39-44
On a~method for compressing information and on the complexity of the realization of monotone symmetric functions
p. 44-52
The complexity of the search for a~deterministic subautomaton
p. 52-56
Tests for circuits with one-type constant faults in the inputs of elements
p. 57-64
A family of distribution algebras
p. 64-72
Comparison of Boolean bases
p. 72-79
Closed Post classes
p. 79-88
On the complexity of probabilistic automata with an isolated cross-section point
p. 88-89