6. MFCS 1977: Tatranska Lomnica, Czechoslovakia

Invited Lectures

• Giorgio Ausiello:
  On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. 1-16
  
• Andrzej Blikle:
  A Comparative Review of Some Program Verification Methods. 17-33
  
• Luc Boasson:
  Classification of the Context-Free Languages. 34-43
  
• Calvin C. Elgot:
  Finite Automaton from a Flowchart Scheme Point of View. 44-51
  
• Erwin Engeler:
  A New Type of Models of Computation. 52-58
  
• Andrei P. Ershov, V. E. Itkin:
  Correctness of Mixed Computation in Algol-Like Programs. 59-77
  
• Ferenc Gécseg, Péter E.-Tóth:
  Algebra and Logic in Theoretical Computer Science. 78-92
  
• Boleslaw Z. Kacewicz, Henryk Wozniakowski:
  A Survey of Recent Problems and Results in Analytic Computational Complexity. 93-107
  
• Hermann A. Maurer, Thomas Ottmann:
  Tree-Structures for Set Manipulation Problems. 108-121
  
• Andrzej Salwicki:
  Applied Algorithmic Logic. 122-134
  
• Claus-Peter Schnorr:
  Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. 135-147
  
• Boris A. Trakhtenbrot:
  Frequency Algorithms and Computations. 148-161
  
• Leslie G. Valiant:
  Graph-Theoretic Arguments in Low-Level Complexity. 162-176
  
• Gerd Wechsung:
  Properties of Complexity Classes: A Short Survey. 177-191
  
• Jesse B. Wright, Eric G. Wagner, James W. Thatcher:
  A Uniform Approach to Inductive Posets and Inductive Closure. 192-212
  

Communications

• Valery N. Agafonov:
  Generalized Probabilistic Grammars. 213-221
  
• Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi:
  Classes of Structurally Isomorphic {NP}-Optimization Problems. 222-230
  
• Jean-Michel Autebert:
  Pushdown-Automata and Families of Languages Generating Cylinders. 231-239
  
• J. W. de Bakker:
  Semantics of Infinite Processes Using Generalized Trees. 240-246
  
• Václav Benda, Kamila Bendová:
  Characterization of Recognizable Families by Means of Regular Languages. 247-252
  
• Alberto Bertoni, Giancarlo Mauri, Mauro Torelli:
  An Algebraic Approach to Problem Solution and Problem Semantics. 253-262
  
• Anton Cerný:
  Complexity and Minimality of Context-Free Grammars and Languages. 263-271
  
• Michal Chytil:
  Comparison of the Active Visiting and the Crossing Complexities. 272-281
  
• Petr Hájek:
  Arithmetical Complexity of Some Problems in Computer Science. 282-287
  
• Friedrich W. von Henke:
  Formal Transformations and the Development of Programs. 288-296
  
• Sándor Horváth:
  Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions. 297-302
  
• Theo M. V. Janssen, Peter van Emde Boas:
  The Expressive Power of Intensional Logic in the Semantics of Programming Languages. 303-311
  
• Max I. Kanovic:
  On the Complexity of Equivalent Transformations in Programming Languages. 312-314
  
• Victor N. Kasyanov, Sergei B. Pokrovsky:
  Schematology in a Multi-Language Optimizer. 315-323
  
• Ivan Korec:
  Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions. 324-332
  
• Jaroslav Král:
  A Top-Down No Backtrack Parsing of General Context-Free Languages. 333-341
  
• Ivan Kramosil:
  A Probabilistic Restriction of Branching Plans. 342-349
  
• Manfred Kudlek, Miroslav Novotný:
  Reducing Operators for Normed General Formal Systems. 350-358
  
• Leonid A. Levin, V. V. V'jugin:
  Invariant Properties of Informational Bulks. 359-364
  
• Matti Linna:
  Two Decidability Results for Deterministic Pushdown Automata. 365-373
  
• Witold Lipski Jr.:
  On the Logic of Incomplete Transformation. 374-381
  
• Aldo de Luca, Settimo Termini:
  Measures of Ambiguity in the Analysis of Complex Systems. 382-389
  
• Robert Meersman, Grzegorz Rozenberg:
  Two-Level Meta-Controlled Substitution Grammars. 390-397
  
• Pierangelo Miglioli, Mario Ornaghi:
  A Calculus to Build Up Correct Programs. 398-409
  
• Peter A. Ng, Sung Y. Bang:
  Another Approach for Proving Program Correctness. 410-419
  
• Anton Nijholt:
  Cover Results and Normal Forms. 420-429
  
• Jan Peckel:
  On a Deterministic Subclass of Context-Free Languages. 430-434
  
• Jan Pittl:
  Exponential Optimization for the {LLP($k$)} Parsing Method. 435-442
  
• Franco P. Preparata:
  The Medial Axis of a Simple Polygon. 443-450
  
• Peter Raulefs:
  Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming Languages. 451-459
  
• Grzegorz Rozenberg, Dirk Vermeir:
  Acceptors for Iteration Languages. 460-464
  
• Peter Ruzicka, Juraj Wiedermann:
  How Good Is the Adversary Lower Bound? 465-474
  
• Stefan Sokolowski:
  Total Correctness for Procedures. 475-483
  
• Ján Sturc:
  A Model for Retrieval Systems and Some Mathematical Problems Behind. 484-492
  
• Ivan Hal Sudborough:
  Time and Tape Bounded Auxiliary Pushdown Automata. 493-503
  
• Ondrej Sýkora:
  A Fast Non-Commutative Algorithm for Matrix Multiplication. 504-512
  
• Jerzy Tiuryn:
  Fixed-Points and Algebras with Infinitely Long Expressions, I. 513-522
  
• Vera Trnková, Jirí Adámek:
  On Languages, Accepted by Machines in the Category of Sets. 523-531
  
• Mars K. Valiev:
  Real Time Computations with Restrictions on Tape Alphabet. 532-536
  
• Victor Vianu:
  The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space. 537-542
  
• Klaus W. Wagner, Gerd Wechsung:
  Complexity Hierarchies of Oracles. 543-548
  
• Horst Wedde, Józef Winkowski:
  Determining Processes by Violations. 549-559
  
• Reinhold Weicker:
  The Influence of the Machine Model on the Time Complexity of Context-Free Language Recognition. 560-569
  
• Klaus Weihrauch:
  A Generalized Computability Thesis (Abstract). 570
  
• Rolf Wiehagen:
  Identification of Formal Languages. 571-579
  
• Joseph A. Goguen, José Meseguer:
  Correctness of Recursive Flow Diagram Programs. 580-595