default search action
8. MFCS 1979: Olomouc, Czechoslovakia
- Jirí Becvár:
Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979. Lecture Notes in Computer Science 74, Springer 1979, ISBN 0-387-09526-8
Invited Lectures
- J. W. de Bakker:
A Sound and Complete Proof System for Partial Program Correctness. 1-12 - J. M. Barzdin:
The Problem of Reachability and Verification of Programs. 13-25 - Andrzej Blikle:
Assertion Programming. 26-42 - Ronald V. Book:
Complexity Classes of Formal Languages (Preliminary Report). 43-56 - Rusins Freivalds:
Fast Probabilistic Algorithms. 57-69 - Juris Hartmanis, Theodore P. Baker:
Relative Succinctness of Representations of Languages and Separation of Complexity Classes. 70-88 - Ivan M. Havel:
On Two Types of Loops. 89-107 - Matthew Hennessy, Gordon D. Plotkin:
Full Abstraction for a Simple Parallel Programming Language. 108-120 - Hermann A. Maurer:
On Some Recent Developments in Cryptography and Their Applications to Computer Science. 121-130 - Kurt Mehlhorn:
Searching, Sorting and Information Theory. 131-145 - Robin Milner:
LCF: A Way of Doing Proofs with a Machine. 146-159 - Vaughan R. Pratt:
Axioms or Algorithms. 160-169 - Arto Salomaa:
Power from Power Series. 170-181 - A. O. Slisenko:
Computational Complexity of String and Graph Identification. 182-190 - Derick Wood:
A Survey of Grammar and L Forms-1978. 191-200
Communications
- Akeo Adachi, Takumi Kasai, Etsuro Moriya:
A Theoretical Study of the Time Analysis of Programs. 201-207 - Hajnal Andréka, István Németi, Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes. 208-218 - Jean-Michel Autebert:
Relationships between AFDL's and Cylinders. 219-227 - Gérard Comyn, G. Werner:
Computable Data Types. 228-236 - Guy Cousineau, Patrice Enjalbert:
Program Equivalence and Provability. 237-245 - Karel Culík II, Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour. 246-257 - Robert P. Daley:
On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. 258-265 - Werner Damm:
An Algebraic Extension of the Chomsky-Hierarchy. 266-276 - Michael I. Dekhtyar:
Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets. 277-283 - Thomas M. Fischer:
On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. 284-291 - George Gens, Eugene Levner:
Computational Complexity of Approximation Algorithms for Combinatorial Problems. 292-300 - A. Goralciková, Václav Koubek:
A Reduct-and-Closure Algorithm for Graphs. 301-307 - Ludmila Gregusová, Ivan Korec:
Small Universal Minsky Machines. 308-316 - Tsutomu Kamimura, Giora Slutzki:
Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). 317-325 - Akira Kanda:
Fully Effective Solutions of Recursive Domain Equations. 326-336 - Ivan Kramosil:
A Note on Computational Complexity of a Statistical Deducibility Testing Procedure. 337-345 - Manfred Kudlek:
Context Free Normal Systems. 346-353 - Matti Linna, Martti Penttonen:
New Proofs for Jump DPDA's. 354-362 - Aldo de Luca, Antonio Restivo:
Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup. 363-371 - G. B. Marandzjan:
On the Sets of Minimal Indices of Partial Recursive Functions. 372-374 - Kurt Mehlhorn:
Some Remarks on Boolean Sums. 375-380 - Grazyna Mirkowska:
On the Propositional Algorithmic Logic. 381-389 - Anton Nijholt
, Eljas Soisalon-Soininen:
Ch(k) Grammars: A Characterization of LL(k) Languages. 390-397 - Thomas Ottmann, Derick Wood:
A Uniform Approach to Balanced Binary and Multiway Trees. 398-407 - Gheorghe Paun:
On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting. 408-414 - Peter Ruzicka:
Validity Test for Floyd's Operator-Precedence Parsing Algorithms. 415-424 - Peter H. Starke:
On the Languages of Bounded Petri Nets. 425-433 - Miron Tegze:
Dyck Language D2 Is Not Absolutely Parallel. 434-442 - Jerzy Tiuryn:
Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract). 443-452 - Boris A. Trakhtenbrot:
On Relaxation Rules in Algorithmic Logic. 453-462 - Vera Trnková:
L-Fuzzy Functorial Automata. 463-473 - G. E. Tseytlin:
Schematics of Structural Parallel Programming and its Applications. 474-481 - Mars K. Valiev:
On Axiomatization of Deterministic Propositional Dynamic Logic. 482-491 - Klaus W. Wagner:
Bounded Recursion and Complexity Classes. 492-498 - Wolfgang Wechler:
Characterization of Rational and Algebraic Power Series. 499-507 - Gerd Wechsung:
A Crossing Measure for 2-Tape Turing Machines. 508-516 - Juraj Wiedermann
The Complexity of Lexicographic Sorting and Searching. 517-522 - Józef Winkowski:
An Algebraic Approach to Concurrence. 523-532 - Hideki Yamasaki:
On Multitape Automata. 533-541 - Stanislav Zák:
A Turing Machine Oracle Hierarchy. 542-551 - Gérard Berry, Jean-Jacques Lévy:
A Survey of Some Syntactic Results in the lambda-Calculus. 552-566 - Guy Cousineau, Maurice Nivat:
On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts. 567-580
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: