1. An order-algebraic definition of knuthian semantics

   • Laurian M. Chirica
   • David F. Martin

   OriginalPaper Pages: 1 - 27

2. Complexity of some problems concerningL systems

   • Neil D. Jones
   • Sven Skyum

   OriginalPaper Pages: 29 - 43

3. Satisfiability problems for propositional calculi

   • Harry R. Lewis

   OriginalPaper Pages: 45 - 53

4. P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP

   • Alan L. Selman

   OriginalPaper Pages: 55 - 65

5. Dolezal's theorem revisited

   • Prodip Sen
   • M. R. Chidambara

   OriginalPaper Pages: 67 - 79

6. Indecomposable local maps of tessellation automata

   • Masakazu Nasu

   OriginalPaper Pages: 81 - 93

7. A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings

   • Richard A. DeMillo
   • Richard J. Lipton

   OriginalPaper Pages: 95 - 104

8. Storage representations for tree-like data structures

   • Arnold L. Rosenberg
   • Derick Wood
   • Zvi Galil

   OriginalPaper Pages: 105 - 130

9. Infinite trees in normal form and recursive equations having a unique solution

   • Bruno Courcelle

   OriginalPaper Pages: 131 - 180

10. Restricted one-counter machines with undecidable universe problems

    • Oscar H. Ibarra

    OriginalPaper Pages: 181 - 186

11. Relative complexity of operations on numeric and bit-string algebras

    • Nancy Lynch
    • Edward K. Blum

    OriginalPaper Pages: 187 - 207

12. On the existence of optimal fixpoints

    • Jean H. Gallier

    OriginalPaper Pages: 209 - 217

13. Formal computations of non deterministic recursive program schemes

    • André Arnold
    • Maurice Nivat

    OriginalPaper Pages: 219 - 236

14. Multiple signal extraction by polynomial filtering

    • W. A. Porter

    OriginalPaper Pages: 237 - 254

15. Categorical and topological aspects of formal languages

    • Evelyn Nelson

    OriginalPaper Pages: 255 - 273

16. Le théorème de transversale rationnelle dans les langages d'arbres

    • A. Arnold

    OriginalPaper Pages: 275 - 282

17. On relativizing auxiliary pushdown machines

    • Dana Angluin

    OriginalPaper Pages: 283 - 299

    

18. On the depth complexity of formulas

    • Eli Shamir
    • Marc Snir

    OriginalPaper Pages: 301 - 322

19. On comparingLL(k) andLR(k) grammars

    • Eljas Soisalon-Soininen

    OriginalPaper Pages: 323 - 329

20. Compelled operations and operations of degreeP

    • F. Rodriguez

    OriginalPaper Pages: 331 - 347

21. Control sets on grammars using depth-first derivations

    • Mark Luker

    OriginalPaper Pages: 349 - 359

22. Global controllability of nonlinear systems in two dimensions

    • L. R. Hunt

    OriginalPaper Pages: 361 - 376