Theoretical Computer Science 1996: Vol 161 Table of Contents

2 Pages·1996·0.23 MB·English

THEORETICAL COMPU:
Algorithms, automata, complexity and games
VOLUME 161, NUMBERS 1-2, 15 JULY 1996
Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fur Mathematik
CONTENTS
FUNDAMENTAL STUDY
Z.-Z. Chen
Parallel constructions of maximal path sets and applications to short superstrings
REGULAR PAPERS
F. Carrere
On the Kleijn—Rozenberg k-adjacent languages 23
S. Labhalla, H. Lombardi and R. Marlin
Algorithmes de calcul de la reduction de Hermite d’une matrice a coefficients
polynomiaux 69
T. Harju, M. Lipponen and A. Mateescu
Flatwords and Post Correspondence Problem 93
A.J. Mayer and L.J. Stockmeyer
The complexity of PDL with interleaving 109
L. Fortnow and M. Kummer
On resource-bounded instance complexity 123
H. Petersen
On the language of primitive words 141
C. Selmi
Over testable languages 157
O. Carton
Chain automata 191
G. Hotz and G. Pitsch
On parsing coupled-context-free languages 205
M. Fulk and S. Jain
Learning in the presence of inaccurate information 235
K.W. Regan
Index sets and presentations of complexity classes 263
O. Maruyama and S. Miyano
Inferring a tree from walks 289
NOTES
F. Cucker and M. Shub
Generalized Knapsack problems and fixed degree separations 301
A.E. Andreev, A.E.F. Clementi and J.D.P. Rolim
Constructing the highest degree subgraph for dense graphs is in VW@V~S 307
Author Index Volume 161