Diskr. Mat., 1993, Volume 5, Issue 4

JOURNALS // Diskretnaya Matematika // Archive

1993, Volume 5, Issue 4

	A method for the design of combinational circuits suitable for control V. N. Noskov		3
	On the intersection of some classes of convergences A. N. Degtev		24
	Large deviation theorems in a scheme of allocating identical particles to different cells A. N. Timashev		29
	Indistinguishability of finite automata in a stationary observation environment I. S. Grunskii, O. M. Kopytova		43
	Inclusion and ambiguity problems for regular events in semigroups L. P. Lisovik		54
	On the correspondence between interval graphs and Boolean functions Nguyen Kim Anh		75
	Families of closed classes of $k$-valued logic that are preserved by all automorphisms Nguyen Van Hoa		87
	Reconstructibility of the fundamental invariants of a graph E. V. Bratceva		109
	Efficient algorithms for calculating the modality of polygons S. N. Bespamyatnykh		120
	On the number of strictly balanced subgraphs of random homogeneous hypergraphs A. V. Shapovalov		133
	Strongly regular locally latticed graphs N. D. Zyulyarkina, A. A. Makhnev		145
	On Losev's method for fast vector-matrix multiplication F. F. Zheludevich		151