8. MFCS 1979: Olomouc, Czechoslovakia
J. W. de Bakker
: A Sound and Complete Proof System for Partial Program Correctness.
J. M. Barzdin
: The Problem of Reachability and Verification of Programs.
Ronald V. Book
: Complexity Classes of Formal Languages (Preliminary Report).
Hermann A. Maurer
: On Some Recent Developments in Cryptography and Their Applications to Computer Science.
: Searching, Sorting and Information Theory.
: LCF: A Way of Doing Proofs with a Machine.
A. O. Slisenko
: Computational Complexity of String and Graph Identification.
: A Survey of Grammar and L Forms-1978.
Robert P. Daley
: On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity.
: An Algebraic Extension of the Chomsky-Hierarchy.
Michael I. Dekhtyar
: Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets.
Thomas M. Fischer
: On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities.
: Fully Effective Solutions of Recursive Domain Equations.
: A Note on Computational Complexity of a Statistical Deducibility Testing Procedure.
G. B. Marandzjan
: On the Sets of Minimal Indices of Partial Recursive Functions.
: On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting.
: Validity Test for Floyd's Operator-Precedence Parsing Algorithms.
: Dyck Language D2 Is Not Absolutely Parallel.
: Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract).
G. E. Tseytlin
: Schematics of Structural Parallel Programming and its Applications.
Mars K. Valiev
: On Axiomatization of Deterministic Propositional Dynamic Logic.
: Characterization of Rational and Algebraic Power Series.
: A Crossing Measure for 2-Tape Turing Machines.
: The Complexity of Lexicographic Sorting and Searching.
, Maurice Nivat
: On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts.