RAIRO. Informatique théorique, Tome 16 (1982) no. 3

Sommaire

Repetitive strings are not context-free

Ross, Rockford ; Winklmann, Karl

p. 191-199

A probabilistic analysis of a new satisfiability algorithm

Apolloni, B. ; Di Gregorio, S.

p. 201-223

Modèles non déterministes de types abstraits

Lescanne, Pierre

p. 225-244

On simple matrix languages versus scattered context languages

Păun, Gheorghe

p. 245-253

Analysis of a class of graph partitioning problems

Bertolazzi, P. ; Lucertini, M. ; Marchetti Spaccamela, A.

p. 255-261

Algebraic complexity of path problems

Mahr, Bernd

p. 263-292