Abstract is missing.
- Exercises in Denotational SemanticsKrzysztof R. Apt, J. W. de Bakker. 1-11
- W-Automata and Their LanguagesWilfried Brauer. 12-22
- On Semantic Issues in the Relational Model of DataJean-Marc Cadiou. 23-38
- The Effective Arrangement of Logical SystemsEdsger W. Dijkstra. 39-51
- Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of ProgramsGiorgio Germano, Andrea Maggiolo-Schettini. 52-64
- Descriptional Complexity (of Languages) - A Short SurveyJozef Gruska. 65-80
- On the Branching Structure of LanguagesIvan M. Havel. 81-98
- Algorithms and Real NumbersN. M. Nagorny. 99-104
- On Mappings of MachinesMiroslav Novotný. 105-114
- Recent Results on L SystemsArto Salomaa. 115-123
- Decision Problems for Multi-Tape AutomataPeter H. Starke. 124-136
- Recursive Program Schemas and Computable FunctionalsBoris A. Trakhtenbrot. 137-152
- Some Fundamentals of Order-Algebraic SemanticsEric G. Wagner, Jesse B. Wright, Joseph A. Goguen, James W. Thatcher. 153-168
- On Attribute GrammarsValery N. Agafonov. 169-172
- Formal Definition of Semantics of Generated Control RegimesLuigia Carlucci Aiello, Mario Aiello, Giuseppe Attardi, P. Cavallari, Gianfranco Prini. 173-179
- Minimal While ProgramsE. S. Bainbridge. 180-186
- On Specfic Features of Recognizable Families of LanguagesVáclav Benda, Kamila Bendová. 187-193
- On the Termination of Simple Computer ProgramsEberhard Bergmann. 194-201
- Reduction of Petri-NetsGérard Berthelot, Gérard Roucairol. 202-209
- On Behaviour of R-Fuzzy AutomataJürgen Brunner, Wolfgang Wechler. 210-215
- Cannonizing Reducibility Method in the Theory of Program SchemataA. O. Buda. 216-223
- Strongly Connected G-S-M Mappings Preserving ConjugationChristian Choffrut. 224-229
- Analysis of the Non-Context-Free Component of Formal LanguagesMichal Chytil. 230-236
- Programs, Computations and Temporal FeaturesMarco Colombetti, Enrico Pagello. 237-243
- A Note on the Automatic Generation of Inductive AssertionsWolfgang Coy. 244-249
- On the Relationship between a Procedure and its DataArmin B. Cremers, Thomas N. Hibbard. 250-254
- On the Relativization of Deterministic and Nondeterministic Complexity ClassesMichael I. Dekhtyar. 255-259
- The Metric Properties on the Semigroups and the LanguagesAlexandru Dinca. 260-264
- A Lower Bound of ½n² on Linear Search Programs for the Knapsack ProblemDavid P. Dobkin, Richard J. Lipton. 265-269
- The Direct Product of Automata and Quasi-AutomataWillibald Dörfler. 270-276
- An Axiomatic Approach to Information StructuresHans-Dieter Ehrich. 277-283
- Parallelism of Manipulations in Multidimensional Information StructuresHartmut Ehrig, Hans-Jörg Kreowski. 284-293
- On Strict Interpretations of Grammar FormsSeymour Ginsburg, Otto Mayer. 294-298
- A Hierarchy of Context-Sensitive LanguagesIrina Gorun. 299-303
- On Consecutive Storage of RecordsJanusz Górski. 304-310
- A Remark on Equivalence of Mazurkiewicz s Finite-Control Algorithms over NetsMichal Grabowski. 311-316
- Microprogram-Oriented Model of the Controlled StructureI. Hansen, Jacek Leszczylowski. 317-322
- Relations between Programs with Different Storage RequirementsM. D. Harrison. 323-329
- An Algebraic Approach to Data Types, Program Verification, and Program SynthesisFriedrich W. von Henke. 330-336
- About Three Equations Classes of Languages Built Up By Shuffle OperationsMatthias Höpner, Manfred Opp. 337-344
- A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time BoundsHagen Huwig. 345-351
- Schemes with Recursion on Higher TypesKlaus Indermark. 352-358
- Constructing Iterative Version of a System of Recursive ProceduresJacek Irlik. 359-363
- A Method Using a Set-Theoretical Formalism to Describe the Semantics of Programming LanguagesWalter Issel. 364-371
- The Cubic Search MethodRomuald Jagielski. 372-376
- Vectors of CoroutinesRyszard Janicki. 377-384
- One-One Degrees of Turing Machines Decision ProblemsJoanna Jedrzejowicz. 385-389
- Heuristic Representation of State-Space by Finite AutomataJozef Kelemen. 390-394
- Semigroup Characterizations of Some Language VarietiesRobert Knast. 395-403
- On Memory Requirements of Strassen s AlgorithmsAntoni Kreczmar. 404-407
- Determinism in Concurrent SystemsWlodzimierz Kwasowiec. 408-415
- Generating Control Mechanisms by RestrictionsKurt Lautenbach, Horst Wedde. 416-422
- On Diagnosis of Algorithmical ProcessesJanusz W. Laski. 423-429
- On Some Properties of Cyclic Automata and Their ExtensionsBoleslaw Mikolajczak. 430-435
- Compiler Generation Using Denotational SemanticsPeter D. Mosses. 436-441
- On Divergence Problems for Program SchemasV. A. Nepomniaschy. 442-445
- On the Parsing of LL-Regular GrammarsAnton Nijholt. 446-452
- The Characteristic Polynomial of a Finite AutomatonDominique Perrin. 453-457
- Error Detection Using Regular LanguagesP. Prusinkiewicz. 458-464
- On a Relationship Between Programs of Address Machines and Mazurkiewicz AlgorithmsZbigniew W. Ras. 465-471
- Dijkstra s Predicate Transformer, Non-Determinism, Recursion and TerminationWillem P. de Roever. 472-481
- Context-Free Programmed Grammars and ETOL SystemsGrzegorz Rozenberg, Dirk Vermeir. 482-487
- Context-Free Algebra: A Mathematical Device for Compiler SpecificationsTeodor Rus. 488-494
- On the Lower Bound for Minimum Comparison SelectionPeter Ruzicka, Juraj Wiedermann. 495-502
- Computational Processes Generated by Programs with Recursive Procedures and Block StructuresAndrzej Salwicki, Tomasz Müldner. 503-509
- An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group LanguagesJacques Sakarovitch. 510-516
- Degrees of Parallelism in ComputationsVladimir Yu. Sazonov. 517-523
- On Adaptability of a System of ProgramsA. Schurmann. 524-529
- A Mathematical Model of Parallel Information ProcessingAndrzej Skowron. 530-536
- PowerdomainsMichael B. Smyth. 537-543
- On the Domain of Iteration in Iterative Algebraic TheoriesJerzy Tiuryn. 544-550
- The Influence of the Data Presentation on the Computational POwer of MachinesRutger Verbeek, Klaus Weihrauch. 551-558
- On Sequential Modelling of Non-Sequential ProcessesJózef Winkowski. 559-568
- Equivalence and Optimization of Recursive Program SchemataZbigniew Zwinogrodzki. 569-575
- Observability Concepts in Abstract Data Type SpecificationsV. Giarratana, F. Gimona, Ugo Montanari. 576-587
- The Calculus of FactsHartmann J. Genrich, Gerda Thieler-Mevissen. 588-595
- Multiplicity Functions on Omega-AutomataMarek Karpinski. 596-601
- A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with ProceduresGrazyna Mirkowska, Andrzej Salwicki. 602-606