Abstract is missing.
- Sharing in NondeterminismEgidio Astesiano, Gerardo Costa. 1-15
- Sur les mots sans carré définis par un morphismeJean Berstel. 16-25
- A Characterization of Abstract Data as Model-Theoretic InvariantsAlberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli. 26-37
- Inherent Ambiguities in Families of Grammars (Extended Abstract)Meera Blattner. 38-48
- Representing Complexity Classes by Equality Sets (Preliminary Report)Ronald V. Book, Franz-Josef Brandenburg. 49-57
- Supercounter MachinesBurchard von Braunmühl, Eckehart Hotzel. 58-72
- Existential Quantifiers in Abstract Data TypesManfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing. 73-87
- A Generalization of Ginsburg and Rose s Characterization of G-S-M MappingsChristian Choffrut. 88-103
- Strict Deterministic Languages and Controlled Rewriting SystemsLaurent Chottin. 104-117
- A String Matching Algorithm Fast on the AverageBeate Commentz-Walter. 118-132
- Functional Characterization of Some Semantic Equalities inside Lambda-CalculusMario Coppo, Mariangiola Dezani-Ciancaglini, Patrick Sallé. 133-146
- Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report)Armin B. Cremers, Thomas N. Hibbard. 147-160
- On the Homomorphic Characterizations of Families of LanguagesKarel Culik II. 161-170
- Two Level Grammars: CF-Grammars with Equation SchemesPiotr Dembinski, Jan Maluszynski. 171-187
- Proving termination with Multiset OrderingsNachum Dershowitz, Zohar Manna. 188-202
- One Abstract Accepting Algorithm for all Kinds of ParsersPeter Deussen. 203-217
- Studies in Abstract/Concrete Mappings in Proving Algorithm CorrectnessArthur G. Duncan, Lawrence Yelowitz. 218-229
- A Characterization of a Dot-Depth Two Analogue of Generalized Definite LanguagesFaith E. Fich, Janusz A. Brzozowski. 230-244
- Partitioned LL(k) GrammarsDietmar Friede. 245-255
- Recursion Schemes and Generalized Interpretations (Extended Abstract)Jean H. Gallier. 256-270
- A Rational Theory of AFLSJonathan Goldstine. 271-281
- On the Succintness of Different Representations of LanguagesJuris Hartmanis. 282-288
- A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic ProgramsSorin Istrail. 289-303
- Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of ComparisonsWolfgang Janko. 304-315
- A Unique Termination Theorem for a Theory with Generalised Commutative AxiomsHans-Josef Jeanrond. 316-330
- DAGs and Chomsky Hierarchy (Extended Abstract)Tsutomu Kamimura, Giora Slutzki. 331-337
- Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract)Richard M. Karp. 338-339
- On the Average Stack Size of Regularly Distributed Binary TreesRainer Kemp. 340-355
- On Reductions of Parallel ProgramsWolfgang Kowalk, Rüdiger Valk. 356-369
- On the Height of Derivation TreesWerner Kuich, Helmut Prodinger, Friedrich J. Urbanek. 370-384
- The Modal Logic of ProgramsZohar Manna, Amir Pnueli. 385-409
- A Comparison Between Two Variations of a Pebble Game on GraphsFriedhelm Meyer auf der Heide. 411-421
- LL(k) Parsing for Attributed GrammarsD. R. Milton, Charles N. Fischer. 422-430
- On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape SpaceBurkhard Monien, Ivan Hal Sudborough. 431-445
- Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version)Anton Nijholt. 446-459
- The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract)Christos H. Papadimitriou, Mihalis Yannakakis. 460-470
- A Systematic Approach to Formal Language Theory Through Parallel RewritingGrzegorz Rozenberg. 471-478
- Extending the Notion of Finite IndexGrzegorz Rozenberg, Dirk Vermeir. 479-488
- On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract)Walter L. Ruzzo. 489-497
- Space-Time Tradeoffs for Oblivious Interger MultiplicationsJohn E. Savage, Sowmitri Swamy. 498-504
- Investigating Programs in Terms of Partial GraphsGunther Schmidt. 505-519
- On the Power of Random Access MachinesArnold Schönhage. 520-529
- An Aximatic Treatment of Algol 68 RoutinesRichard L. Schwartz. 530-545
- P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NPAlan L. Selman. 546-555
- Constructing Call-by-Value Continuation SemanticsRavi Sethi, Adrian Tang. 556-570
- A Formal Semantics for Concurrent SystemsM. W. Shields, Peter E. Lauer. 571-584
- Con Constructing LL(k) ParsersSeppo Sippu, Eljas Soisalon-Soininen. 585-595
- More on Advice on Structuring Compilers and Proving Them CorrectJames W. Thatcher, Eric G. Wagner, Jesse B. Wright. 596-615
- Languages of Nilpotent and Solvable Groups (Extended Abstract)Denis Thérien. 616-632
- Unique Fixed Points v. Least Fixed PointsJerzy Tiuryn. 633-645
- A Modification of the LR(k) Method for Constructing Compact Bottom-Up ParsersEsko Ukkonen. 646-658
- Optimal Decomposition of Linear AutomataLászló Úry. 659-667
- Bracketed Two-Level Grammars - A Decidable and Practical Approach to Language DefinitionsLutz Michael Wegner. 668-682