Geodesic

Volume 5 (1993) no. 4

Sommaire

A~method for the design of combinational circuits suitable for control
p. 3-23
On the intersection of some classes of convergences
p. 24-28
Large deviation theorems in a~scheme of allocating identical particles to different cells
p. 29-42
Indistinguishability of finite automata in a~stationary observation environment
p. 43-53
Inclusion and ambiguity problems for regular events in semigroups
p. 54-74
On the correspondence between interval graphs and Boolean functions
p. 75-86
Families of closed classes of $k$-valued logic that are preserved by all automorphisms
p. 87-108
Reconstructibility of the fundamental invariants of a~graph
p. 109-119
Efficient algorithms for calculating the modality of polygons
p. 120-132
On the number of strictly balanced subgraphs of random homogeneous hypergraphs
p. 133-144
Strongly regular locally latticed graphs
p. 145-150
On Losev's method for fast vector-matrix multiplication
p. 151-157