Tome 16 (1982) no. 3

Sommaire

Repetitive strings are not context-free
p. 191-199
A probabilistic analysis of a new satisfiability algorithm
p. 201-223
Modèles non déterministes de types abstraits
p. 225-244
On simple matrix languages versus scattered context languages
p. 245-253
Analysis of a class of graph partitioning problems
p. 255-261
Algebraic complexity of path problems
p. 263-292