Sommaire

Éditorial

ITA

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

Numdam
Completing codes

Restivo, A. ; Salemi, S. ; Sportelli, T.

Access to full text
Full (PDF)
Full (DJVU)
p. 135-147

Numdam
Sur des points fixes de morphismes d'un monoïde libre

Allouche, J.-P. ; Betrema, J. ; Shallit, J. O.

Access to full text
Full (PDF)
Full (DJVU)
p. 235-249

Numdam
Motifs et bases de langages

Autebert, Jean-Michel ; Boasson, Luc ; Latteux, Michel

Access to full text
Full (PDF)
Full (DJVU)
p. 379-393

Numdam
Polygon placement under translation and rotation

Avnaim, Francis ; Boissonnat, Jean-Daniel

Access to full text
Full (PDF)
Full (DJVU)
p. 5-28

Numdam
Disjunctive languages and compatible orders

Ito, M. ; Shyr, H. J. ; Thierrin, G.

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

Numdam
Algorithms for weighted graph problems on the modified cellular graph automaton

Venkatasubramanian, S. ; Krithivasan, Kamala ; Rangan, C. Pandu

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

Numdam
Compositions de fonctions de commutation partielle

Clerbout, Mireille

Access to full text
Full (PDF)
Full (DJVU)
p. 395-424

Numdam
Hotz-isomorphism theorems in formal language theory

Diekert, Volker ; Möbus, Axel

Access to full text
Full (PDF)
Full (DJVU)
p. 29-43

Numdam
An application of m-ary trees to the design of data structures for geometric searching problems

Talamo, M. ; Gambosi, G.

Access to full text
Full (PDF)
Full (DJVU)
p. 165-176

Numdam
Asymptotical behaviour of some non-uniform measures

Serna, Maria José

Access to full text
Full (PDF)
Full (DJVU)
p. 281-293

Numdam
Codes et motifs

Ratoandromanana, Bodonirina

Access to full text
Full (PDF)
Full (DJVU)
p. 425-444

Numdam
The relation of two patterns with comparable languages patterns

Filé, Gilberto

Access to full text
Full (PDF)
Full (DJVU)
p. 45-57

Numdam
Nonuniform complexity classes specified by lower and upper bounds

Balcázar, José L. ; Gabarró, Joaquim

Access to full text
Full (PDF)
Full (DJVU)
p. 177-194

Numdam
Factorisation des ensembles préfixiels

Bruyère, Véronique

Access to full text
Full (PDF)
Full (DJVU)
p. 295-315

Numdam
Non recursive functions have transcendental generating series

Cucker, Felipe ; Gabarró, Joaquim

Access to full text
Full (PDF)
Full (DJVU)
p. 445-448

Numdam
Fairness and regularity for SCCS processes

Guessarian, Irène ; Niar-Dinedane, Wafâa

Access to full text
Full (PDF)
Full (DJVU)
p. 59-86

Numdam
Production en temps réel et complexité de structure de suites infinies

Bleuzen-Guernalec, Noëlle ; Blanc, Georges

Access to full text
Full (PDF)
Full (DJVU)
p. 195-216

Numdam
Combinatorial analysis of quicksort algorithm

Hennequin, P.

Access to full text
Full (PDF)
Full (DJVU)
p. 317-333

Numdam
Représentations matricielles des séries d'arbre reconnaissables

Bozapalidis, Symeon ; Alexandrakis, Athanasios

Access to full text
Full (PDF)
Full (DJVU)
p. 449-459

Numdam
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata

Jenner, Birgit ; Kirsig, Bernd

Access to full text
Full (PDF)
Full (DJVU)
p. 87-99

Numdam
A normal form for restricted exponential functions

Degano, Pierpaolo ; Gianni, Patrizia

Access to full text
Full (PDF)
Full (DJVU)
p. 217-231

Numdam
A limiting distribution for quicksort

Régnier, Mireille

Access to full text
Full (PDF)
Full (DJVU)
p. 335-343

Numdam
Sur quelques classes d’applications de N 2 dans les ensembles finis

Moulin Ollagnier, Jean

Access to full text
Full (PDF)
Full (DJVU)
p. 461-492

Numdam
On computations with integer division

Just, Bettina ; Meyer auf der Heide, Friedhelm ; Wigderson, Avi

Access to full text
Full (PDF)
Full (DJVU)
p. 101-111

Numdam
La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász

Vallée, Brigitte

Access to full text
Full (PDF)
Full (DJVU)
p. 345-376

Numdam
Efficient distributed algorithms by using the archimedean time assumption

Spirakis, Paul ; Tampakas, Basil

Access to full text
Full (PDF)
Full (DJVU)
p. 113-128

Numdam