Mathematical Foundations of Computer Science 1977

Correctness of mixed computation in ALGOL-like programs

Ershov, A. P. (et al.)

Pages 59-77

Algebra and logic in theoretical computer science

Gécseg, Ferenc (et al.)

Pages 78-92

A survey of recent problems and results in analytic computational complexity

Kacewicz, B. (et al.)

Pages 93-107

Tree-structures for set manipulation problems

Maurer, H. A. (et al.)

Pages 108-121

Applied algorithmic logic

Salwicki, Andrzej

Pages 122-134

Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials

Schnorr, C. P.

Pages 135-147

Frequency algorithms and computations

Trakhtenbrot, B. A.

Pages 148-161

Graph-theoretic arguments in low-level complexity

Valiant, Leslie G.

Pages 162-176

Properties of complexity classes a short survey

Wechsung, Gerd

Pages 177-191

A uniform approach to inductive posets and inductive closure

Wright, J. B. (et al.)

Pages 192-212

Generalized probabilistic grammars

Agafonov, V. N.

Pages 213-221

Classes of structurally isomorphic np-optimization problems

Ausiello, Giorgio (et al.)

Pages 222-230

Pushdown-automata and families of languages generating cylinders

Autebert, Jean-Michel

Pages 231-239

Semantics of infinite processes using generalized trees

Bakker, J. W.

Pages 240-246

Characterization of recognizable families by means of regular languages

Benda, Václav (et al.)

Pages 247-252

An algebraic approach to problem solution and problem semantics

Bertoni, A. (et al.)

Pages 253-262

Complexity and minimality of context-free grammars and languages

Černý, A.

Pages 263-271

Comparison of the active visiting and the crossing complexities

Chytil, Michal P.

Pages 272-281

Arithmetical complexity of some problems in computer science

Hájek, P.

Pages 282-287

Formal transformations and the development of programs

Henke, Friedrich W.

Pages 288-296

Optimal rasp programs for arbitrarily complex 0–1 valued functions

Horváth, Sándor

Pages 297-302

The expressive power of intensional logic in the semantics of programming languages

Janssen, T. M. V. (et al.)

Pages 303-311

On the complexity of equivalent transformations in programming languages

Kanovič, Max I.

Pages 312-314

Schematology in a MJ I/T I-language OPT imizer

Kasyanov, V. N. (et al.)

Pages 315-323

Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions

Korec, Ivan

Pages 324-332

A top-down no backtrack parsing of general context-free languages

Král, Jaroslav

Pages 333-341

A probabilistic restriction of branching plans

Kramosil, Ivan

Pages 342-349

Reducing operators for normed general formal systems

Kudlek, Manfred (et al.)

Pages 350-358

Invariant properties of informational bulks

Levin, L. A. (et al.)

Pages 359-364

Two decidability results for deterministic pushdown automata

Linna, Matti

Pages 365-373

On the logic of incomplete information

Lipski, Witold, Jr.

Pages 374-381

Measures of ambiguity in the analysis of complex systems

Luca, Aldo (et al.)

Pages 382-389

Two-level meta-controlled substitution grammars

Meersman, R. (et al.)

Pages 390-397

A calculus to build up correct programs

Miglioli, P. A. (et al.)

Pages 398-409

Another approach for proving program correctness

Ng, Peter A. (et al.)

Pages 410-419

Cover results and normal forms

Nijholt, Anton

Pages 420-429

On a deterministic subclass of context-free languages

Peckel, Jan

Pages 430-434

Exponential optimization for the LLP(k) parsing method

Pittl, Jan

Pages 435-442

The medial axis of a simple polygon

Preparata, F. P.

Pages 443-450

Semantics and proof rules for coroutine hierarchies in block-structured programming languages

Raulefs, Peter

Pages 451-459

Acceptors for iteration languages

Rozenberg, G. (et al.)

Pages 460-464

How good is the adversary lower bound ?

Ružička, Peter (et al.)

Pages 465-474

Total correctness for procedures

Sokołowski, Stefan

Pages 475-483

A model for retrieval systems and some mathematical problems behind

Sturc, Ján

Pages 484-492