Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

1989, Volume 1, Issue 4  

Realization of systems of conjunctions by means of switching circuits
I. A. Vikhlyantsev 		3–11
Upper bounds on finite-automaton complexity for generalized regular expressions in a one-letter alphabet
Z. R. Dang 		12–16
Bases of a functional system
G. Kilibarda 		17–25
Modeling and decomposition of automata by means of calculators
V. V. Peretrukhin 		26–35
The complexity of realizing partial Boolean functions by schemes consisting of functional elements
A. E. Andreev 		36–45
Randomized decomposable statistics in a generalized allocation scheme over a countable set of cells
Sh. A. Mirakhmedov 		46–62
Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
Ya. Ya. Kanep 		63–77
Maximal cardinality of the shadow of an antichain
I. P. Chukhrov 		78–85
Completeness of two-place boundedly deterministic functions with respect to superposition
D. N. Babin 		86–91
Asymptotic normality of decomposable statistics from the frequencies of $m$-chains
V. G. Mikhailov 		92–103
Complexity of some problems in editing words
S. S. Martynov 		104–112
A multidimensional critical Galton–Watson branching process with final types
V. A. Vatutin, N. M. Yanev 		113–122
Kerdock's code in cyclic form
A. A. Nechaev 		123–139

Information
V. A. Emilichev, O. I. Mel'nikov, V. I. Sarvanov, R. I. Tyshkevich “Lectures in graph theory”
 140
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025