Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO. Theoretical Informatics and Applications
  • Volume 19 (1985)
  • no. 3

Volume 19 (1985) no. 3

Table of contents


On the equivalence of compositions of morphisms and inverse morphisms on regular languages
Karhumäki, J.; Kleijn, H. C. M.
p. 203-211

Algorithme de décomposition de clés
Pichat, E.  
p. 213-232

Reduction algorithms for some classes of aperiodic monoids
König, Roman
p. 233-260

On temporal program verification rules
Kröger, F.
p. 261-280

Sur les semi-groupes vérifiant le théorème de Kleene
Reutenauer, Christophe
p. 281-291

A formalism for treating equivalence of recursive procedures
Pelin, Alex
p. 293-313
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of