Abstract is missing.
- Simple EOL Forms under Uniform Interpretation Generating CF LanguagesJürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg. 1-14
- Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract)Doris Altenkamp, Kurt Mehlhorn. 15-25
- Sul l inversion des morphisms d arbresAndré Arnold, Max Dauchet. 26-35
- Grammars with Dynamic Control SetsGerhard Barth. 36-51
- Ambiguite ForteJoffroy Beauquier. 52-62
- Relationship Between Density and Deterministic Complexity of NP-Complete LanguagesPiotr Berman. 63-71
- Stable Models of Typed lambda-CalculiGérard Berry. 72-89
- Path Measures of Turing Machine Computations (Preliminary Report)Joachim Biskup. 90-104
- Une Famille Remarquable de Codes IndecomposablesJean-Marie Boë. 105-112
- Comparisons and Reset Machines (Preliminary Report)Ronald V. Book, Sheila A. Greibach, Celia Wrathall. 113-124
- Size-Depth Tradeoff in Boolean FormulasBeate Commentz-Walter. 125-141
- (Semi)-separability of Finite Sets of Terms in Scott s D_infty-Models of the lambda-CalculusMario Coppo, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca. 142-164
- Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract)Armin B. Cremers, Thomas N. Hibbard. 165-176
- On the Power of Self-Application and Higher Type-RecursionWerner Damm, Elfriede Fehr. 177-191
- Time and Space Bounds for Selection ProblemsDavid P. Dobkin, J. Ian Munro. 192-204
- Stepwise Specification and Implementation of Abstract Data TypesHartmut Ehrig, Hans-Jörg Kreowski, Peter Padawitz. 205-226
- The Complexity of Equivalence and Containment for Free Single Variable Program SchemesSteven Fortune, John E. Hopcroft, Erik Meineche Schmidt. 227-240
- On Improving the Worst Case Running Time of the Boyer-Moore String Matching AlgorithmZvi Galil. 241-250
- Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive ProceduresJean H. Gallier. 251-267
- Arithmetical Completeness in Logics of ProgramsDavid Harel. 268-288
- Covering a Graph by CircuitsAlon Itai, Michael Rodeh. 289-299
- A PSPACE Complete Problem Related to a Pebble GameAndrzej Lingas. 300-321
- Some Effective Results About Linear Recursive SequencesMaurice Mignotte. 322-329
- On the Parsing and Covering of Simple Chain GrammarsAnton Nijholt. 330-344
- Sur un Cas Particulier de la Conjecture de CernyJean-Eric Pin. 345-352
- States Can Sometimes Do More Than Stack Symbols in PDA sJohn K. Price, Detlef Wotschke. 353-362
- Some Decision Results for Recognizable Sets in Arbitrary MonoidsAntonio Restivo. 363-371
- Sur les Series Rationnelles en Variables Non CommutativesChristophe Reutenauer. 372-381
- On Constructing Efficient Evaluators for Attribute GrammarsMikko Saarinen. 382-397
- Une Extension de la Theorie des Types en lambda-CalculPatrick Sale. 398-410
- Parallel and Nondeterministic Time Complexity Classes (Preliminary Report)Walter J. Savitch. 411-424
- Multiterminal Network Flow and Connectivity in Unsymmetrical NetworksClaus-Peter Schnorr. 425-439
- Admissible Coherent CPO sEdward Sciore, A. Tang. 440-456
- Integration of the Phase-Difference Relations in Asynchronous Sequential NetworksTommaso Toffoli. 457-463
- Self-Modifying Nets, a Natural Extension of Petri NetsRüdiger Valk. 464-476
- Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal FormMarisa Venturini Zilli. 477-493
- Characterization Problems in the Theory of Inductive InferenceRolf Wiehagen. 494-508