6. FCT 1987: Kazan, USSR

@proceedings{DBLP:conf/fct/1987,
  editor    = {Lothar Budach and
               Rais Gatic Bakharajev and
               Oleg Borisovic Lipanov},
  title     = {Fundamentals of Computation Theory, International Conference
               FCT'87, Kazan, USSR, June 22-26, 1987, Proceedings},
  booktitle = {FCT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {278},
  year      = {1987},
  isbn      = {3-540-18740-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Farid M. Ablayev:
  Possibilities of Probabilistic on-line Counting Machines. 1-4
  
• Gennady P. Agibalov:
  Functional Systems on Semilattices. 5-9
  
• Valery B. Alekseyev: Recognition of Properties in K-Valued Logic and Approximate Algorithms. 10-13
• A. A. Alexanyan:
  Linearized Disjunctive Normal Forms of Boolean Functions. 14-16
  
• Ju. A. Al'pin, B. S. Kotchkarev, R. G. Mubarakzianov:
  On a Stable Generating of Random Sequences by Probabilistic Automata. 17-20
  
• S. V. Alyoshin:
  Automata Classes Induced by Post Classes. 21-23
  
• Alexander E. Andreev:
  Effective Lower Bounds for Complexity of Some Classes of Schemes. 24-29
  
• A. V. Anisimov, Vladimir A. Oleshchuk:
  Stable Finite Automata Mappings and Church-Rosser Systems. 30-33
  
• Marat M. Arslanov:
  The Recursion Theorem, Approximations, and Classifying Index Sets of Recursively Enumerable Sets. 34-37
  
• A. D. Astakhov:
  Duality of Functions and Data in Algorithms Description. 38-40
  
• G. V. Babikov:
  On Direct Methods of Realization of Normal Algorithms by Turing Machines. 41
  
• D. N. Babin:
  Verbal Operation on Automaton. 42-44
  
• A. S. Barashko:
  The New Way of Probabilistic Compact Testing. 45-47
  
• M. Yu. Baryshev, L. P. Zhil'tzova, A. A. Markov:
  Computational Problems in Alphabetic Coding Theory. 48-50
  
• S. A. Bogomolov:
  On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments. 51-52
  
• A. A. Bolotov:
  On the Equivalence Problem of States for Cellular Automata. 53-54
  
• Lothar Budach:
  Arsenals and Lower Bounds. 55-64
  
• R. G. Bukharajev, A. I. Enikeev, I. I. Makarov:
  Chain-like Model of Programs Communication. 65-67
  
• R. G. Bukharajev, I. R. Nasirov:
  Structur Automata. 68-73
  
• B. A. Buyevich:
  On A-Completeness for some Classes of Bounded Determitate Functions. 74-77
  
• G. E. Cejtlin, E. L. Jushchenko:
  Structure Synthesis of Parallel Programs (Methodology and Tools). 78-81
  
• Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks:
  Saturating Flows in Networks. 82-91
  
• I. P. Cuhrov:
  On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity. 92-94
  
• Jürgen Dassow, Helmut Jürgensen:
  Soliton Automata. 95-102
  
• A. I. Enikeev:
  On Development of Dialogue Concurrent Systems. 103-108
  
• S. M. Ermakov, B. B. Pokhodzey:
  Discrete Analogue of the Neumann Method is not Optimal. 109-112
  
• S. M. Ermakov, A. S. Rasulov:
  A Simplest Probability Model of Asynchronous Iterations. 113-115
  
• Yuri Leonidovich Ershov, Sergei S. Goncharov, Dmitri Ivanovich Sviridenko:
  Semantic Foundations of Programming. 116-122
  
• N. V. Evtushenko:
  Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines. 123-126
  
• A. B. Frolov:
  On the Digital System Diagnostics under Uncertainty. 127-131
  
• N. Z. Gabbasov:
  The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata. 132-136
  
• E. E. Gasanov:
  Some Asymptotic Evalutions of Complexity of Information Searching. 137-139
  
• Sergej B. Gashkov:
  On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases. 140-144
  
• Igor Gashkov, V. M. Sidelnikov:
  Codes, Connected With a Fraction Linear Functions Group and Their Decoding. 150-149
  
• Dainis Geidmanis:
  On the Capabilities of Alternating and Nondeterministic Multitape Automata. 150-154
  
• Alan Gibbons, Wojciech Rytter:
  Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. 155-162
  
• M. I. Grinchuk:
  On the Complexity of Elementary Periodical Functions Realized by Switching Circuites. 163-166
  
• Hans-Dietrich O. F. Gronau:
  Efficient Algorithmic Construction of Designs. 167-171
  
• Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt:
  On the Complexity of Lie Algebras. 172-179
  
• I. S. Grunsky:
  A Characterization of Sequential Machines by Means of Their Behaviour Fragments. 180-184
  
• Juris Hartmanis:
  Some Observations of NP Complete Sets. 185-196
  
• Armin Hemmerling:
  Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract). 197-203
  
• Klaus Indermark, Herbert Klaeren:
  Efficient Implementation of Structural Recursion. 204-213
  
• M. A. Iordanskii:
  Minimal Numberings of the Vertices of Trees - Approximate Approach. 214-217
  
• Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen:
  Dyck₁-Reductions of Context-free Languages. 218-227
  
• Stasys Jukna:
  Information Flow and Width of Branching Programs (Extended Abstract). 228-230
  
• L. M. Karahanjan, Alexander A. Sapozhenko:
  On Some Operations of Partial Monotone Boolean Function Simplifying. 231-233
  
• N. A. Karpova:
  On Complexity of Computations with Limited Memory. 234-235
  
• K. V. Kolyada:
  On the Problem of Completeness for the Regular Mappings. 236-237
  
• A. D. Korshunov:
  The Number and the Structure of Typical Sperner and K-Non-Separable Families of Subsets of a Finite Set. 239-243
  
• Nikolai K. Kossovsky:
  A Chriterion of Polynominal Lower Bounds of Combinational Complexity. 244-245
  
• Vadim E. Kotov, Ludmila Cherkasova:
  On Generalized Process Logic. 246-250
  
• Wojciech Kowalczyk, Pawel Urzyczyn:
  Verification of Programs with Higher-Order Arrays. 251-258
  
• V. A. Kozlovskiy:
  On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton. 259-262
  
• Klaus Kriegel, Stephan Waack:
  Exponential Lower Bounds for Real-Time Branching Programs. 263-267
  
• V. B. Kudrjavitzev:
  On the Conditions of Supplementicity in Functional Systems. 268-271
  
• Nikolai N. Kuzjurin:
  On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables. 272
  
• S. E. Kuznetsov, N. N. Nurmeev, F. I. Salimov:
  The Problem of Minimal Implicating Vector. 273-278
  
• R. Kh. Latypov:
  Built-in Self-testing of Logic Circuits Using Imperfect Duplication. 279-283
  
• Alexander A. Letichevsky:
  Algebras with Approximation and Excursive Data Structures. 284-287
  
• Irina A. Lomazova:
  Procedural Implementation of Algebraic Specifications of Abstract Data Types. 288-292
  
• Sergej A. Lozkin, M. A. Koshkin:
  On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits. 293-296
  
• Sergej A. Lozkin, A. A. Semenov:
  On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions. 297-300
  
• Yu. Matijasevich:
  Diophantine Complexity. 301
  
• Christoph Meinel:
  The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs. 302-309
  
• M. V. Men'shikov, S. A. Zuev:
  Estimation Algorithms of Infinite Graphs Percolation Threshold. 310-313
  
• V. J. Mikhailov:
  A Solving of Problems on Technological Models. 314-317
  
• Grigori Mints:
  Some Formal Systems of the Logic Programming. 318-322
  
• Mikhail Ju. Moshkov:
  On the Programs with Finite Development. 323-327
  
• G. L. Movsisian, Zh. G. Margarian:
  D-Representing Code Problem Solution. 328-331
  
• R. G. Mubarakzianov:
  Metric Properties of Random Sequence. 332-333
  
• V. I. Mukhin:
  Adaptive Strategies for Partially Observable Controlled Ranom Series. 334-338
  
• Ildar R. Nasyrov:
  The Degrees of Nondeterminism in Pushdown Automata. 339-342
  
• V. N. Noskov:
  Statistically Effective Algorithms for Automata Control. 343-346
  
• V. I. Pereyaslavsky:
  Linear Test Procedures of Recognition. 347-348
  
• I. G. Perfilyeva:
  Evaluatiobn of Cardinalities of Some Families of -Classes in P_roh0. 349-353
  
• A. S. Podkolzin:
  On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous Automata. 354-358
  
• R. I. Podlovcenko:
  On Approximate Solution of the Problem of Equivalent Transformations of Programs. 359-363
  
• Sanguthevar Rajasekaran, John H. Reif:
  Ranomized Parallel Computation. 364-376
  
• N. P. Redkin:
  On Checking Correctness of Some Classes of Control Systems. 377-382
  
• I. K. Rystsov:
  The Parallel Complexity of Some Arithemic and Algebraic Operations. 383-385
  
• A. A. Safarian:
  On Difficulties of Solving a Problem of Decomposition of the System of Boolean Equations. 386-388
  
• Alexander A. Sapozhenko:
  The Number of Fuzzy Monotone Functions. 389-390
  
• Vladimir Yu. Sazonov:
  Bounded Set Theory and Polynominal Computability. 391-395
  
• Victor L. Selivanov:
  Index-Sets of Factor-Objects of the Post Numbering. 396-400
  
• N. A. Shkalikova:
  On Realization of Boolean Functions by Schemes Consisting of Checked Elements. 401-405
  
• L. A. Sholomov:
  The Complexity of the Sequential Choice Mechanism. 406-408
  
• V. D. Soloviev:
  Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability. 409-411
  
• V. R. Solovieva:
  The Reducibility of Random Sequences by Automata. 412-413
  
• S. A. Stepanov, Igor Shparlinski:
  On Structure Complexity of Normal Basis of Finite Field. 414-416
  
• Vladimir Stetsenko:
  On Comparison of Boolean Bases. 417-419
  
• Elena Stöhr:
  A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs. 420-423
  
• A. S. Strogalov:
  On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping. 424-427
  
• E. A. Sumenkov:
  Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation. 428-431
  
• A. A. Sytnik:
  Synthesis of Universal Finite Automats. 432-434
  
• V. A. Taimanov:
  On Cartesian Powers of P₂. 435
  
• Daina Taimina:
  Complexity Gaps of Turing Machines of Infinite Words. 436-439
  
• Gerard Tel:
  Distributed Infimum Approximation. 440-447
  
• Bernhard Thalheim:
  On the Number of Keys in Relational Databases. 448-455
  
• A. B. Ugol'nikov:
  Complexity and Depth of Formulas Realizing Functions From Closed Classes. 456-461
  
• Dietmar Uhlig:
  Reliable Networks from Unreliable Gates With Almost Minimal Complexity. 462-469
  
• P. I. Validov:
  On the Standard and Pseudostandard Star Height of Regular Sets. 470-471
  
• S. N. Vassiljev:
  To Automation of Theorem Sythesis. 472-476
  
• E. G. Vorobyova:
  On Efficiency of Prefix Word-Encoding of Binary Messages. 477-478
  
• Andrei Voronkov:
  Deductive Program Synthesis and Markov's Principle. 479-482
  
• V. M. Zacharov, S. E. Kuznetsov:
  Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements. 483-487
  
• Vladimir A. Zakharov:
  To the Functional Equivalence of Turing Machines. 488-491
  
• Michael Zakharyaschev:
  Theorem Proving in Intermediate and Modal Logics. 492-496
  
• Arkadij Zakrevskij:
  The Analysis of Concurrent Logic Control Algorithms. 497-500
  
• N. K. Zamov:
  On a Connection Between the Resolution Method and the Inverse Method. 501-505
  

Last update Mon Feb 13 04:25:42 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page