An order-algebraic definition of knuthian semantics Laurian M. ChiricaDavid F. Martin OriginalPaper Pages: 1 - 27
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP Alan L. Selman OriginalPaper Pages: 55 - 65
A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings Richard A. DeMilloRichard J. Lipton OriginalPaper Pages: 95 - 104
Storage representations for tree-like data structures Arnold L. RosenbergDerick WoodZvi Galil OriginalPaper Pages: 105 - 130
Infinite trees in normal form and recursive equations having a unique solution Bruno Courcelle OriginalPaper Pages: 131 - 180
Restricted one-counter machines with undecidable universe problems Oscar H. Ibarra OriginalPaper Pages: 181 - 186
Relative complexity of operations on numeric and bit-string algebras Nancy LynchEdward K. Blum OriginalPaper Pages: 187 - 207
Formal computations of non deterministic recursive program schemes André ArnoldMaurice Nivat OriginalPaper Pages: 219 - 236
Le théorème de transversale rationnelle dans les langages d'arbres A. Arnold OriginalPaper Pages: 275 - 282
Global controllability of nonlinear systems in two dimensions L. R. Hunt OriginalPaper Pages: 361 - 376