Abstract is missing.
- How Hard is Compiler Code Generation?Alfred V. Aho, Ravi Sethi. 1-15
- Natural Complexity Measures and Time versus Memory: Some Definitional ProposalsDonald A. Alton. 16-29
- Semantics and Proof Theory of Pascal ProceduresKrzysztof R. Apt, J. W. de Bakker. 30-44
- On the Structure of Combinatorial Problems and Structure Preserving ReductionsGiorgio Ausiello, Alessandro D Atri, Marco Protasi. 45-60
- Factor Graphs, Failure Functions and BI-TreesRoland Carl Backhouse, R. K. Lutz. 61-75
- Parallel Decomposition of LR(k) Parsers (Extended Abstract)David B. Benson, Ralph D. Jeffords. 76-86
- Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic AutomataAlberto Bertoni, Giancarlo Mauri, Mauro Torelli. 87-94
- Termination Tests inside lambda-CalculusCorrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini. 95-110
- On the Computational Power of Reversal-Bounded MachinesRonald V. Book, Chee-Keng Yap. 111-119
- The Contextsensitivity Bounds of Contextsensitive Grammars and LanguagesFranz-Josef Brandenburg. 120-134
- Serial Composition of 2-Way Finite-State Transducers and Simple Programs on StringsMichal Chytil, Vojtech Jákl. 135-147
- The Sequence Equivalence Problem for D0L Systems is DecidableKarel Culik II, Ivan Fris. 148-163
- Languages Defined by Higher Type Program SchemesWerner Damm. 164-179
- Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse StructuresErnst-Wolfgang Dieterich. 180-192
- On Three Types of Unambiguity of Context-Free LanguagesAlexander Ja. Dikovsky, Larisa S. Modina. 193-205
- The Mathematics of Record HandlingHartmut Ehrig, Barry K. Rosen. 206-220
- Macro Grammars, Lindenmayer Systems and Other Copying DevicesJoost Engelfriet. 221-229
- On the Time and Tape Complexity of Hyper(1)-AFL sWilhelm J. Erni. 230-243
- Renaming and Erasing in Szilard LanguagesMatthias Höpner, Manfred Opp. 244-257
- Some Matching ProblemsAlon Itai, Michael Rodeh. 258-268
- Complexite des Demi-Groupes de MatricesGérard Jacob. 269-281
- On the Proper Treatment or Referencing, Dereferencing and AssignmentTheo M. V. Janssen, Peter van Emde Boas. 282-300
- Complexity of Some Problems Concerning L SystemsNeil D. Jones, Sven Skyum. 301-308
- Left-Fitting TranslationsHans-Peter Kriegel, Thomas Ottmann. 309-322
- Dynamic Binary SearchKurt Mehlhorn. 323-336
- About the Derivation Languages of Grammars and MachinesBurkhard Monien. 337-351
- Simple Chain GrammarsAnton Nijholt. 352-364
- Time-Space Trade-Offs in a Pebble GameWolfgang J. Paul, Robert Endre Tarjan. 365-369
- Non-Deterministic Polynomial Optimization Problems and Their ApproximationAzaria Paz, Shlomo Moran. 370-379
- Simple Programs and Their Decision ProblemsAmir Pnueli, Giora Slutzki. 380-390
- Theory of Data Structures by Relational and Graph GrammarsVaclav Rajlich. 391-411
- On Backtracking and Greatest FixpointsWillem P. de Roever. 412-429
- L Systems of Finite Index (Extended Abstract)Grzegorz Rozenberg, Dirk Vermeir. 430-439
- The Safety of a Coroutine SystemJorma Sajaniemi. 440-452
- Linear Time Simulation of Multihead Turing Machines with Head-to-Head JumpsWalter J. Savitch, Paul M. B. Vitányi. 453-464
- Data Types as ObjectsAdi Shamir, William W. Wadge. 465-479
- On the Difference Between One and Many (Preliminary Version)Janos Simon. 480-491
- On Defining Error Recovery in Context-Free ParsingSeppo Sippu, Eljas Soisalon-Soininen. 492-503
- LL(k) Languages are Closed Under Union with Finite LanguagesIleana Streinu. 504-508
- The Time and Tape Complexity of Developmental LanguagesIvan Hal Sudborough. 509-523
- Rational relations of Binary TreesMasako Takahashi. 524-538
- Structural Equivalence of Context-Free Grammar Forms is DecidableHermann K.-G. Walter. 539-553
- On the Definition of Classes of InterpretationsBruno Courcelle. 554-569