MFCS B

62 papers

YearTitle / Authors
1977A Calculus to Build Up Correct Programs.
Pierangelo Miglioli, Mario Ornaghi
1977A Comparative Review of Some Program Verification Methods.
Andrzej Blikle
1977A Fast Non-Commutative Algorithm for Matrix Multiplication.
Ondrej Sýkora
1977A Generalized Computability Thesis (Abstract).
Klaus Weihrauch
1977A Model for Retrieval Systems and Some Mathematical Problems Behind.
Ján Sturc
1977A New Type of Models of Computation.
Erwin Engeler
1977A Probabilistic Restriction of Branching Plans.
Ivan Kramosil
1977A Survey of Recent Problems and Results in Analytic Computational Complexity.
Boleslaw Z. Kacewicz, Henryk Wozniakowski
1977A Top-Down No Backtrack Parsing of General Context-Free Languages.
Jaroslav Král
1977A Uniform Approach to Inductive Posets and Inductive Closure.
Jesse B. Wright, Eric G. Wagner, James W. Thatcher
1977Acceptors for Iteration Languages.
Grzegorz Rozenberg, Dirk Vermeir
1977Algebra and Logic in Theoretical Computer Science.
Ferenc Gécseg, Péter Ecsedi-Tóth
1977An Algebraic Approach to Problem Solution and Problem Semantics.
Alberto Bertoni, Giancarlo Mauri, Mauro Torelli
1977Another Approach for Proving Program Correctness.
Peter A. Ng, Sung Y. Bang
1977Applied Algorithmic Logic.
Andrzej Salwicki
1977Arithmetical Complexity of Some Problems in Computer Science.
Petr Hájek
1977Characterization of Recognizable Families by Means of Regular Languages.
Václav Benda, Kamila Bendová
1977Classes of Structurally Isomorphic {NP}-Optimization Problems.
Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
1977Classification of the Context-Free Languages.
Luc Boasson
1977Comparison of the Active Visiting and the Crossing Complexities.
Michal Chytil
1977Complexity Hierarchies of Oracles.
Klaus W. Wagner, Gerd Wechsung
1977Complexity and Minimality of Context-Free Grammars and Languages.
Anton Cerný
1977Correctness of Mixed Computation in Algol-Like Programs.
Andrei P. Ershov, V. E. Itkin
1977Correctness of Recursive Flow Diagram Programs.
Joseph A. Goguen, José Meseguer
1977Cover Results and Normal Forms.
Anton Nijholt
1977Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions.
Ivan Korec
1977Determining Processes by Violations.
Horst F. Wedde, Józef Winkowski
1977Exponential Optimization for the {LLP($k$)} Parsing Method.
Jan Pittl
1977Finite Automaton from a Flowchart Scheme Point of View.
Calvin C. Elgot
1977Fixed-Points and Algebras with Infinitely Long Expressions, I.
Jerzy Tiuryn
1977Formal Transformations and the Development of Programs.
Friedrich W. von Henke
1977Frequency Algorithms and Computations.
Boris A. Trakhtenbrot
1977Generalized Probabilistic Grammars.
Valery N. Agafonov
1977Graph-Theoretic Arguments in Low-Level Complexity.
Leslie G. Valiant
1977How Good Is the Adversary Lower Bound?
Peter Ruzicka, Juraj Wiedermann
1977Identification of Formal Languages.
Rolf Wiehagen
1977Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.
Claus-Peter Schnorr
1977Invariant Properties of Informational Bulks.
Leonid A. Levin, V. V. V'jugin
1977Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings
Jozef Gruska
1977Measures of Ambiguity in the Analysis of Complex Systems.
Aldo de Luca, Settimo Termini
1977On Languages, Accepted by Machines in the Category of Sets.
Vera Trnková, Jirí Adámek
1977On a Deterministic Subclass of Context-Free Languages.
Jan Peckel
1977On the Complexity of Equivalent Transformations in Programming Languages.
Max I. Kanovic
1977On the Logic of Incomplete Transformation.
Witold Lipski Jr.
1977On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems.
Giorgio Ausiello
1977Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions.
Sándor Horváth
1977Properties of Complexity Classes: A Short Survey.
Gerd Wechsung
1977Pushdown-Automata and Families of Languages Generating Cylinders.
Jean-Michel Autebert
1977Real Time Computations with Restrictions on Tape Alphabet.
Mars K. Valiev
1977Reducing Operators for Normed General Formal Systems.
Manfred Kudlek, Miroslav Novotný
1977Schematology in a Multi-Language Optimizer.
Victor N. Kasyanov, Sergei B. Pokrovsky
1977Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming Languages.
Peter Raulefs
1977Semantics of Infinite Processes Using Generalized Trees.
J. W. de Bakker
1977The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space.
Victor Vianu
1977The Expressive Power of Intensional Logic in the Semantics of Programming Languages.
Theo M. V. Janssen, Peter van Emde Boas
1977The Influence of the Machine Model on the Time Complexity of Context-Free Language Recognition.
Reinhold Weicker
1977The Medial Axis of a Simple Polygon.
Franco P. Preparata
1977Time and Tape Bounded Auxiliary Pushdown Automata.
Ivan Hal Sudborough
1977Total Correctness for Procedures.
Stefan Sokolowski
1977Tree-Structures for Set Manipulation Problems.
Hermann A. Maurer, Thomas Ottmann
1977Two Decidability Results for Deterministic Pushdown Automata.
Matti Linna
1977Two-Level Meta-Controlled Substitution Grammars.
Robert Meersman, Grzegorz Rozenberg