Geodesic

Tome 9 (1997) no. 2

Sommaire

Code and design
p. 3-11
Closed classes in many-valued logic that contain the class of polynomials
p. 12-23
The structure of the lattice of closed classes of polynomials
p. 24-39
A lower bound for the complexity of the realization of a Boolean function by two-layer switching circuits on a plane integral lattice
p. 40-52
On the complexity and depth of circuits realizing partial Boolean functions
p. 53-58
On the functional decomposability of Boolean threshold functions
p. 59-73
On the completeness of systems of finite automata
p. 74-78
On some properties of algebras with simple multiplication that contain associative subalgebra
p. 79-90
Realization of hypergraphs by trees of minimal diameter
p. 91-97
An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs
p. 98-105
On minimal universal graphs for hereditary classes
p. 106-115
On regressive enumerations
p. 116-119
Limit theorems for the number of empty cells
p. 120-130
A conditional limit theorem with a random number of summands
p. 131-138
$\Sigma TC$-generated languages and relative equivalence problems
p. 139-160