Abstract is missing.
- On omega-sets Associated with Context-Free LanguagesMatti Linna. 1-19
- A Characterization of LL(k) LanguagesEljas Soisalon-Soininen, Esko Ukkonen. 20-30
- On a Family of Codes Related to Factorization of Cyclotomic PolynomialsAntonio Restivo. 38-44
- Sur la longeur moyenne des codes préfixesDominique Perrin. 45-51
- Sur les monoïdes syntactiques des langages algébriques déterministesJacques Sakarovitch. 52-65
- Générateurs algébriques non-ambigusJoffroy Beauquier. 66-73
- Bi-transductions de forêtsAndré Arnold, Max Dauchet. 74-86
- Logical Rules of Natural Reasoning about ProgramsFred Kröger. 87-98
- Informational Systems with Incomplete InformationWitold Lipski Jr.. 120-130
- Event Based Reasoning - A System for Proving Correct Termination of ProgramsJ. Schwarz. 131-146
- A Theory of Computation with an Identity DiscriminatorGiuseppe Longo, Marisa Venturini Zilli. 147-167
- Program Equivalence and Canonical Forms in Stable Discrete InterpretationsGérard Berry, Bruno Courcelle. 168-188
- Semantic Equivalence of Program Schemes and its Syntactic CharacterizationIrène Guessarian. 189-200
- Proving Programs IncorrectDaniel Brand. 201-227
- User-Defined Data Types as an Aid to Verifying LISP ProgramsRobert Cartwright. 228-256
- CONS Should Not Evaluate its ArgumentsDaniel P. Friedman, David S. Wise. 257-284
- Ink, Dirty-Tape Turing Machines, and Quasicomplexity MeasuresJohn Gill, István Simon. 285-306
- The Depth of Boolean FunctionsWilliam F. McColl. 307-321
- Optimal Algorithms for Self-Reducible ProblemsClaus-Peter Schnorr. 322-337
- Lower Bounds for the Space Complexity of Context-Free RecognitionHelmut Alt, Kurt Mehlhorn. 338-354
- On the Construction of Huffman TreesJan van Leeuwen. 382-410
- A Linear Algorithm for Testing Isomorphism of Planar GraphsMax Fontet. 411-424
- A Note on the Average Time to Compute Transitive ClosuresPeter A. Bloniarz, Michael J. Fischer, Albert R. Meyer. 425-434
- Semantics and Termination of Nondeterministic Recursive ProgramsJ. W. de Bakker. 435-477
- The Semantics of NondeterminismMatthew Hennessy, Edward A. Ashcroft. 478-493
- On Proofs of Programs for SynchronizationIrene Greif. 494-507
- Eliminating Blind Alleys from Backtrack ProgramsMichel Sintzoff. 531-557