Abstract is missing.
- A Sound and Complete Proof System for Partial Program CorrectnessJ. W. de Bakker. 1-12
- The Problem of Reachability and Verification of ProgramsJ. M. Barzdin. 13-25
- Assertion ProgrammingAndrzej Blikle. 26-42
- Complexity Classes of Formal Languages (Preliminary Report)Ronald V. Book. 43-56
- Fast Probabilistic AlgorithmsRusins Freivalds. 57-69
- Relative Succinctness of Representations of Languages and Separation of Complexity ClassesJuris Hartmanis, Theodore P. Baker. 70-88
- On Two Types of LoopsIvan M. Havel. 89-107
- Full Abstraction for a Simple Parallel Programming LanguageMatthew Hennessy, Gordon D. Plotkin. 108-120
- On Some Recent Developments in Cryptography and Their Applications to Computer ScienceHermann A. Maurer. 121-130
- Searching, Sorting and Information TheoryKurt Mehlhorn. 131-145
- LCF: A Way of Doing Proofs with a MachineRobin Milner. 146-159
- Axioms or AlgorithmsVaughan R. Pratt. 160-169
- Power from Power SeriesArto Salomaa. 170-181
- Computational Complexity of String and Graph IdentificationA. O. Slisenko. 182-190
- A Survey of Grammar and L Forms-1978Derick Wood. 191-200
- A Theoretical Study of the Time Analysis of ProgramsAkeo Adachi, Takumi Kasai, Etsuro Moriya. 201-207
- Completeness Problems in Verification of Programs and Program SchemesHajnal Andréka, István Németi, Ildikó Sain. 208-218
- Relationships between AFDL s and CylindersJean-Michel Autebert. 219-227
- Computable Data TypesGérard Comyn, G. Werner. 228-236
- Program Equivalence and ProvabilityGuy Cousineau, Patrice Enjalbert. 237-245
- Interactive L Systems with Almost Interactionless BehaviourKarel Culik II, Juhani Karhumäki. 246-257
- On the Simplification of Constructions in Degrees of Unsolvability via Computational ComplexityRobert P. Daley. 258-265
- An Algebraic Extension of the Chomsky-HierarchyWerner Damm. 266-276
- Bounds on Computational Complexity and Approximability of Initial Segments of Recursive SetsMichael I. Dekhtyar. 277-283
- On the Weighted Path Length of Binary Search Trees for Unknown Access ProbabilitiesThomas M. Fischer. 284-291
- Computational Complexity of Approximation Algorithms for Combinatorial ProblemsGeorge Gens, Eugene Levner. 292-300
- A Reduct-and-Closure Algorithm for GraphsA. Goralciková, Václav Koubek. 301-307
- Small Universal Minsky MachinesLudmila Gregusová, Ivan Korec. 308-316
- Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract)Tsutomu Kamimura, Giora Slutzki. 317-325
- Fully Effective Solutions of Recursive Domain EquationsAkira Kanda. 326-336
- A Note on Computational Complexity of a Statistical Deducibility Testing ProcedureIvan Kramosil. 337-345
- Context Free Normal SystemsManfred Kudlek. 346-353
- New Proofs for Jump DPDA sMatti Linna, Martti Penttonen. 354-362
- Synchronization and Maximality for Very Pure Subsemigroups of a Free SemigroupAldo de Luca, Antonio Restivo. 363-371
- On the Sets of Minimal Indices of Partial Recursive FunctionsG. B. Marandzjan. 372-374
- Some Remarks on Boolean SumsKurt Mehlhorn. 375-380
- On the Propositional Algorithmic LogicGrazyna Mirkowska. 381-389
- Ch(k) Grammars: A Characterization of LL(k) LanguagesAnton Nijholt, Eljas Soisalon-Soininen. 390-397
- A Uniform Approach to Balanced Binary and Multiway TreesThomas Ottmann, Derick Wood. 398-407
- On the Generative Capacity of Some Classes of Grammars with Regulated RewritingGheorghe Paun. 408-414
- Validity Test for Floyd s Operator-Precedence Parsing AlgorithmsPeter Ruzicka. 415-424
- On the Languages of Bounded Petri NetsPeter H. Starke. 425-433
- Dyck Language D::2:: Is Not Absolutely ParallelMiron Tegze. 434-442
- Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract)Jerzy Tiuryn. 443-452
- On Relaxation Rules in Algorithmic LogicBoris A. Trakhtenbrot. 453-462
- L-Fuzzy Functorial AutomataVera Trnková. 463-473
- Schematics of Structural Parallel Programming and its ApplicationsG. E. Tseytlin. 474-481
- On Axiomatization of Deterministic Propositional Dynamic LogicMars K. Valiev. 482-491
- Bounded Recursion and Complexity ClassesKlaus W. Wagner. 492-498
- Characterization of Rational and Algebraic Power SeriesWolfgang Wechler. 499-507
- A Crossing Measure for 2-Tape Turing MachinesGerd Wechsung. 508-516
- The Complexity of Lexicographic Sorting and SearchingJuraj Wiedermann. 517-522
- An Algebraic Approach to ConcurrenceJózef Winkowski. 523-532
- On Multitape AutomataHideki Yamasaki. 533-541
- A Turing Machine Oracle HierarchyStanislav Zák. 542-551
- A Survey of Some Syntactic Results in the lambda-CalculusGérard Berry, Jean-Jacques Lévy. 552-566
- On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow ChartsGuy Cousineau, Maurice Nivat. 567-580