FCT B

111 papers

YearTitle / Authors
1987A Characterization of Sequential Machines by Means of Their Behaviour Fragments.
Igor S. Grunsky
1987A Chriterion of Polynominal Lower Bounds of Combinational Complexity.
Nikolai K. Kossovsky
1987A Simplest Probability Model of Asynchronous Iterations.
S. M. Ermakov, A. S. Rasulov
1987A Solving of Problems on Technological Models.
V. J. Mikhailov
1987A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs.
Elena Stöhr
1987Adaptive Strategies for Partially Observable Controlled Ranom Series.
V. I. Mukhin
1987Algebras with Approximation and Excursive Data Structures.
Alexander A. Letichevsky
1987Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation.
E. A. Sumenkov
1987Arsenals and Lower Bounds.
Lothar Budach
1987Automata Classes Induced by Post Classes.
S. V. Alyoshin
1987Bounded Set Theory and Polynominal Computability.
Vladimir Yu. Sazonov
1987Built-in Self-testing of Logic Circuits Using Imperfect Duplication.
R. Kh. Latypov
1987Chain-like Model of Programs Communication.
R. G. Bukharajev, A. I. Enikeev, I. I. Makarov
1987Codes, Connected With a Fraction Linear Functions Group and Their Decoding.
Igor Gashkov, V. M. Sidelnikov
1987Complexity Gaps of Turing Machines of Infinite Words.
Daina Taimina
1987Complexity and Depth of Formulas Realizing Functions From Closed Classes.
A. B. Ugol'nikov
1987Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements.
V. M. Zacharov, S. E. Kuznetsov
1987Computational Problems in Alphabetic Coding Theory.
M. Yu. Baryshev, L. P. Zhil'tzova, A. A. Markov
1987Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines.
Nina V. Evtushenko
1987D-Representing Code Problem Solution.
G. L. Movsisian, Zh. G. Margarian
1987Deductive Program Synthesis and Markov's Principle.
Andrei Voronkov
1987Diophantine Complexity.
Yu. Matijasevich
1987Discrete Analogue of the Neumann Method is not Optimal.
S. M. Ermakov, B. B. Pokhodzey
1987Distributed Infimum Approximation.
Gerard Tel
1987Duality of Functions and Data in Algorithms Description.
A. D. Astakhov
1987Dyck
Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen
1987Effective Lower Bounds for Complexity of Some Classes of Schemes.
Alexander E. Andreev
1987Efficient Algorithmic Construction of Designs.
Hans-Dietrich O. F. Gronau
1987Efficient Implementation of Structural Recursion.
Klaus Indermark, Herbert Klaeren
1987Estimation Algorithms of Infinite Graphs Percolation Threshold.
M. V. Men'shikov, S. A. Zuev
1987Evaluatiobn of Cardinalities of Some Families of -Classes in P
I. G. Perfilyeva
1987Exponential Lower Bounds for Real-Time Branching Programs.
Klaus Kriegel, Stephan Waack
1987Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
Alan Gibbons, Wojciech Rytter
1987Functional Systems on Semilattices.
Gennady P. Agibalov
1987Fundamentals of Computation Theory, International Conference FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings
Lothar Budach, Rais Gatic Bakharajev, Oleg Borisovic Lipanov
1987Index-Sets of Factor-Objects of the Post Numbering.
Victor L. Selivanov
1987Information Flow and Width of Branching Programs (Extended Abstract).
Stasys Jukna
1987Linear Test Procedures of Recognition.
V. I. Pereyaslavsky
1987Linearized Disjunctive Normal Forms of Boolean Functions.
A. A. Alexanyan
1987Metric Properties of Random Sequence.
R. G. Mubarakzianov
1987Minimal Numberings of the Vertices of Trees - Approximate Approach.
M. A. Iordanskii
1987Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability.
V. D. Soloviev
1987On A-Completeness for some Classes of Bounded Determitate Functions.
B. A. Buyevich
1987On Approximate Solution of the Problem of Equivalent Transformations of Programs.
R. I. Podlovcenko
1987On Cartesian Powers of P
V. A. Taimanov
1987On Checking Correctness of Some Classes of Control Systems.
N. P. Redkin
1987On Comparison of Boolean Bases.
Vladimir Stetsenko
1987On Complexity of Computations with Limited Memory.
N. A. Karpova
1987On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions.
Sergej A. Lozkin, A. A. Semenov
1987On Development of Dialogue Concurrent Systems.
A. I. Enikeev
1987On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations.
A. A. Safarian
1987On Direct Methods of Realization of Normal Algorithms by Turing Machines.
G. V. Babikov
1987On Efficiency of Prefix Word-Encoding of Binary Messages.
E. G. Vorobyova
1987On Generalized Process Logic.
Vadim E. Kotov, Ludmila Cherkasova
1987On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping.
A. S. Strogalov
1987On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables.
Nikolai N. Kuzjurin
1987On Realization of Boolean Functions by Schemes Consisting of Checked Elements.
N. A. Shkalikova
1987On Some Operations of Partial Monotone Boolean Function Simplifying.
L. M. Karahanjan, Alexander A. Sapozhenko
1987On Structure Complexity of Normal Basis of Finite Field.
S. A. Stepanov, Igor E. Shparlinski
1987On a Connection Between the Resolution Method and the Inverse Method.
N. K. Zamov
1987On a Stable Generating of Random Sequences by Probabilistic Automata.
Ju. A. Al'pin, B. S. Kotchkarev, R. G. Mubarakzianov
1987On the Capabilities of Alternating and Nondeterministic Multitape Automata.
Dainis Geidmanis
1987On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton.
V. A. Kozlovskiy
1987On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases.
Sergej B. Gashkov
1987On the Complexity of Elementary Periodical Functions Realized by Switching Circuites.
M. I. Grinchuk
1987On the Complexity of Lie Algebras.
Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt
1987On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits.
Sergej A. Lozkin, M. A. Koshkin
1987On the Conditions of Supplementicity in Functional Systems.
V. B. Kudrjavitzev
1987On the Digital System Diagnostics under Uncertainty.
A. B. Frolov
1987On the Equivalence Problem of States for Cellular Automata.
A. A. Bolotov
1987On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity.
I. P. Cuhrov
1987On the Number of Keys in Relational Databases.
Bernhard Thalheim
1987On the Problem of Completeness for the Regular Mappings.
K. V. Kolyada
1987On the Programs with Finite Development.
Mikhail Ju. Moshkov
1987On the Standard and Pseudostandard Star Height of Regular Sets.
P. I. Validov
1987On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments.
Sergey A. Bogomolov
1987On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous Automata.
A. S. Podkolzin
1987Possibilities of Probabilistic on-line Counting Machines.
Farid M. Ablayev
1987Procedural Implementation of Algebraic Specifications of Abstract Data Types.
Irina A. Lomazova
1987Ranomized Parallel Computation.
Sanguthevar Rajasekaran, John H. Reif
1987Recognition of Properties in K-Valued Logic and Approximate Algorithms.
Valery B. Alekseyev
1987Reliable Networks from Unreliable Gates With Almost Minimal Complexity.
Dietmar Uhlig
1987Saturating Flows in Networks.
Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks
1987Semantic Foundations of Programming.
Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko
1987Soliton Automata.
Jürgen Dassow, Helmut Jürgensen
1987Some Asymptotic Evalutions of Complexity of Information Searching.
E. E. Gasanov
1987Some Formal Systems of the Logic Programming.
Grigori Mints
1987Some Observations of NP Complete Sets.
Juris Hartmanis
1987Stable Finite Automata Mappings and Church-Rosser Systems.
A. V. Anisimov, Vladimir A. Oleshchuk
1987Statistically Effective Algorithms for Automata Control.
V. N. Noskov
1987Structur Automata.
R. G. Bukharajev, I. R. Nasirov
1987Structure Synthesis of Parallel Programs (Methodology and Tools).
G. E. Cejtlin, E. L. Jushchenko
1987Synthesis of Universal Finite Automats.
A. A. Sytnik
1987The Analysis of Concurrent Logic Control Algorithms.
Arkadij Zakrevskij
1987The Complexity of the Sequential Choice Mechanism.
Lev A. Sholomov
1987The Degrees of Nondeterminism in Pushdown Automata.
Ildar R. Nasyrov
1987The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata.
N. Z. Gabbasov
1987The New Way of Probabilistic Compact Testing.
A. S. Barashko
1987The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite Set.
A. D. Korshunov
1987The Number of Fuzzy Monotone Functions.
Alexander A. Sapozhenko
1987The Parallel Complexity of Some Arithemic and Algebraic Operations.
I. K. Rystsov
1987The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs.
Christoph Meinel
1987The Problem of Minimal Implicating Vector.
S. E. Kuznetsov, N. N. Nurmeev, F. I. Salimov
1987The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets.
Marat M. Arslanov
1987The Reducibility of Random Sequences by Automata.
V. R. Solovieva
1987Theorem Proving in Intermediate and Modal Logics.
Michael Zakharyaschev
1987Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract).
Armin Hemmerling
1987To Automation of Theorem Sythesis.
S. N. Vassiljev
1987To the Functional Equivalence of Turing Machines.
Vladimir A. Zakharov
1987Verbal Operation on Automaton.
D. N. Babin
1987Verification of Programs with Higher-Order Arrays.
Wojciech Kowalczyk, Pawel Urzyczyn