Sommaire

Systèmes de déduction pour les arbres et les schémas de programme (II)

Enjalbert, P.

Access to full text
Full (PDF)
Full (DJVU)
p. 3-21

Numdam
Sémantique des processus communicants

Arnold, André

Access to full text
Full (PDF)
Full (DJVU)
p. 103-139

Numdam
Arbitrary weight changes in dynamic trees

Mehlhorn, Kurt

Access to full text
Full (PDF)
Full (DJVU)
p. 183-211

Numdam
On the structure of general stochastic automata

Daduna, Hans

Access to full text
Full (PDF)
Full (DJVU)
p. 287-302

Numdam
On subdirectly irreducible automata

Demlová, M. ; Demel, J. ; Koubek, V.

Access to full text
Full (PDF)
Full (DJVU)
p. 23-46

Numdam
Transductions rationnelles décroissantes

Leguy, Jeannine

Access to full text
Full (PDF)
Full (DJVU)
p. 141-148

Numdam
Transducteurs finis d'arbres et tests d'égalité

Lilin, E.

Access to full text
Full (PDF)
Full (DJVU)
p. 213-232

Numdam
Une formalisation des systèmes conversationnels

Queinnec, C.

Access to full text
Full (PDF)
Full (DJVU)
p. 303-336

Numdam
Sur l'auto-stabilisation dans un réseau d'ordinateurs

Tchuente, Maurice

Access to full text
Full (PDF)
Full (DJVU)
p. 47-66

Numdam
Relational morphisms and operations on recognizable sets

Straubing, Howard

Access to full text
Full (PDF)
Full (DJVU)
p. 149-159

Numdam
Closure properties of certain families of formal languages with respect to a generalization of cyclic closure

Brandstadt, Andreas

Access to full text
Full (PDF)
Full (DJVU)
p. 233-252

Numdam
Synchronized EOL forms under uniform interpretation

Maurer, H. A. ; Salomaa, A. ; Wood, D.

Access to full text
Full (PDF)
Full (DJVU)
p. 337-353

Numdam
A theory of complexity of monadic recursion schemes

Dikovskii, A. Ja.

Access to full text
Full (PDF)
Full (DJVU)
p. 67-94

Numdam
FPOL systems generating counting languages

Ehrenfeucht, A. ; Rozenberg, G.

Access to full text
Full (PDF)
Full (DJVU)
p. 161-173

Numdam
The theory of invertible algorithms

Aguzzi, Gianni

Access to full text
Full (PDF)
Full (DJVU)
p. 253-279

Numdam
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation

Avenhaus, J. ; Madlener, K.

Access to full text
Full (PDF)
Full (DJVU)
p. 355-371

Numdam
Finiteness results on rewriting systems

Raoult, Jean-Claude

Access to full text
Full (PDF)
Full (DJVU)
p. 373-391

Numdam