Home
 
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Keywords
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
  • Volume 16 (1982)
  • no. 3

Table of contents

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
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of