Abstract is missing.
- On the Structure and Properties of NP-Complete Problems and Their Associated Optimization ProblemsGiorgio Ausiello. 1-16
- A Comparative Review of Some Program Verification MethodsAndrzej Blikle. 17-33
- Classification of the Context-Free LanguagesLuc Boasson. 34-43
- Finite Automaton from a Flowchart Scheme Point of ViewCalvin C. Elgot. 44-51
- A New Type of Models of ComputationErwin Engeler. 52-58
- Correctness of Mixed Computation in Algol-Like ProgramsAndrei P. Ershov, V. E. Itkin. 59-77
- Algebra and Logic in Theoretical Computer ScienceFerenc Gécseg, Péter E.-Tóth. 78-92
- A Survey of Recent Problems and Results in Analytic Computational ComplexityBoleslaw Z. Kacewicz, Henryk Wozniakowski. 93-107
- Tree-Structures for Set Manipulation ProblemsHermann A. Maurer, Thomas Ottmann. 108-121
- Applied Algorithmic LogicAndrzej Salwicki. 122-134
- Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate PolynomialsClaus-Peter Schnorr. 135-147
- Frequency Algorithms and ComputationsBoris A. Trakhtenbrot. 148-161
- Graph-Theoretic Arguments in Low-Level ComplexityLeslie G. Valiant. 162-176
- Properties of Complexity Classes: A Short SurveyGerd Wechsung. 177-191
- A Uniform Approach to Inductive Posets and Inductive ClosureJesse B. Wright, Eric G. Wagner, James W. Thatcher. 192-212
- Generalized Probabilistic GrammarsValery N. Agafonov. 213-221
- Classes of Structurally Isomorphic {NP}-Optimization ProblemsGiorgio Ausiello, Alessandro D Atri, Marco Gaudiano, Marco Protasi. 222-230
- Pushdown-Automata and Families of Languages Generating CylindersJean-Michel Autebert. 231-239
- Semantics of Infinite Processes Using Generalized TreesJ. W. de Bakker. 240-246
- Characterization of Recognizable Families by Means of Regular LanguagesVáclav Benda, Kamila Bendová. 247-252
- An Algebraic Approach to Problem Solution and Problem SemanticsAlberto Bertoni, Giancarlo Mauri, Mauro Torelli. 253-262
- Complexity and Minimality of Context-Free Grammars and LanguagesAnton Cerný. 263-271
- Comparison of the Active Visiting and the Crossing ComplexitiesMichal Chytil. 272-281
- Arithmetical Complexity of Some Problems in Computer SciencePetr Hájek. 282-287
- Formal Transformations and the Development of ProgramsFriedrich W. von Henke. 288-296
- Optimal RAS Programs for Arbitrarily Complex 0-1 Valued FunctionsSándor Horváth. 297-302
- The Expressive Power of Intensional Logic in the Semantics of Programming LanguagesTheo M. V. Janssen, Peter van Emde Boas. 303-311
- On the Complexity of Equivalent Transformations in Programming LanguagesMax I. Kanovic. 312-314
- Schematology in a Multi-Language OptimizerVictor N. Kasyanov, Sergei B. Pokrovsky. 315-323
- Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) InstructionsIvan Korec. 324-332
- A Top-Down No Backtrack Parsing of General Context-Free LanguagesJaroslav Král. 333-341
- A Probabilistic Restriction of Branching PlansIvan Kramosil. 342-349
- Reducing Operators for Normed General Formal SystemsManfred Kudlek, Miroslav Novotný. 350-358
- Invariant Properties of Informational BulksLeonid A. Levin, V. V. V jugin. 359-364
- Two Decidability Results for Deterministic Pushdown AutomataMatti Linna. 365-373
- On the Logic of Incomplete TransformationWitold Lipski Jr.. 374-381
- Measures of Ambiguity in the Analysis of Complex SystemsAldo de Luca, Settimo Termini. 382-389
- Two-Level Meta-Controlled Substitution GrammarsRobert Meersman, Grzegorz Rozenberg. 390-397
- A Calculus to Build Up Correct ProgramsPierangelo Miglioli, Mario Ornaghi. 398-409
- Another Approach for Proving Program CorrectnessPeter A. Ng, Sung Y. Bang. 410-419
- Cover Results and Normal FormsAnton Nijholt. 420-429
- On a Deterministic Subclass of Context-Free LanguagesJan Peckel. 430-434
- Exponential Optimization for the {LLP( k )} Parsing MethodJan Pittl. 435-442
- The Medial Axis of a Simple PolygonFranco P. Preparata. 443-450
- Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming LanguagesPeter Raulefs. 451-459
- Acceptors for Iteration LanguagesGrzegorz Rozenberg, Dirk Vermeir. 460-464
- How Good Is the Adversary Lower Bound?Peter Ruzicka, Juraj Wiedermann. 465-474
- Total Correctness for ProceduresStefan Sokolowski. 475-483
- A Model for Retrieval Systems and Some Mathematical Problems BehindJán Sturc. 484-492
- Time and Tape Bounded Auxiliary Pushdown AutomataIvan Hal Sudborough. 493-503
- A Fast Non-Commutative Algorithm for Matrix MultiplicationOndrej Sýkora. 504-512
- Fixed-Points and Algebras with Infinitely Long Expressions, IJerzy Tiuryn. 513-522
- On Languages, Accepted by Machines in the Category of SetsVera Trnková, Jirí Adámek. 523-531
- Real Time Computations with Restrictions on Tape AlphabetMars K. Valiev. 532-536
- The Bodnarchuk Metric Space of Languages and the Topology of the Learning SpaceVictor Vianu. 537-542
- Complexity Hierarchies of OraclesKlaus W. Wagner, Gerd Wechsung. 543-548
- Determining Processes by ViolationsHorst Wedde, Józef Winkowski. 549-559
- The Influence of the Machine Model on the Time Complexity of Context-Free Language RecognitionReinhold Weicker. 560-569
- A Generalized Computability Thesis (Abstract)Klaus Weihrauch. 570
- Identification of Formal LanguagesRolf Wiehagen. 571-579
- Correctness of Recursive Flow Diagram ProgramsJoseph A. Goguen, José Meseguer. 580-595