Sommaire

Algebraic and topological theory of languages

Rhodes, J. ; Weil, P.

Access to full text
Full (PDF)
Full (DJVU)
p. 1-44

Numdam
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique

Béal, Marie-Pierre

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

Numdam
Equations on the semidirect product of a finite semilattice by a 𝒥-trivial monoid of height k

Blanchet-Sadri, F.

Access to full text
Full (PDF)
Full (DJVU)
p. 157-170

Numdam
Analysis of quickselect : an algorithm for order statistics

Mahmoud, Hosam M. ; Modarres, Reza ; Smythe, Robert T.

Access to full text
Full (PDF)
Full (DJVU)
p. 255-276

Numdam
Unavoidable languages, cuts and innocent sets of words

Rosaz, L.

Access to full text
Full (PDF)
Full (DJVU)
p. 339-382

Numdam
Parallel algorithms on interval graphs

Balayogan, V. B. ; Pandu Rangan, C.

Access to full text
Full (PDF)
Full (DJVU)
p. 451-470

Numdam
Uniformly growing backtrack trees

Kemp, Rainer

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

Numdam
On morphically generated formal power series

Honkala, Juha

Access to full text
Full (PDF)
Full (DJVU)
p. 105-127

Numdam
Binary trees, fringe thickness and minimum path length

Cameron, Helen ; Wood, Derick

Access to full text
Full (PDF)
Full (DJVU)
p. 171-191

Numdam
Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable

Maksimenko, Marianne

Access to full text
Full (PDF)
Full (DJVU)
p. 277-284

Numdam
Token transfer in a faulty network

Diks, Krzysztof ; Malinowski, Adam ; Pelc, Andrzej

Access to full text
Full (PDF)
Full (DJVU)
p. 383-400

Numdam
Complexity of E0L structural equivalence

Salomaa, Kai ; Wood, Derick ; Yu, Sheng

Access to full text
Full (PDF)
Full (DJVU)
p. 471-485

Numdam
A note on read-k times branching programs

Jukna, Stasys

Access to full text
Full (PDF)
Full (DJVU)
p. 75-83

Numdam
On parallel deletions applied to a word

Kari, Lila ; Mateescu, Alexandru ; Paun, Gheorghe ; Salomaa, Arto

Access to full text
Full (PDF)
Full (DJVU)
p. 129-144

Numdam
Fibrations and recursivity

Mijoule, Richard

Access to full text
Full (PDF)
Full (DJVU)
p. 193-208

Numdam
Minimum complexity of automatic non sturmian sequences

Tapsoba, T.

Access to full text
Full (PDF)
Full (DJVU)
p. 285-291

Numdam
Mineurs d'arbres avec racines

Courcelle, B. ; Pariès, A.

Access to full text
Full (PDF)
Full (DJVU)
p. 401-422

Numdam
On bandwidth, cutwidth, and quotient graphs

Barth, Dominique ; Pellegrini, François ; Raspaud, André ; Roman, Jean

Access to full text
Full (PDF)
Full (DJVU)
p. 487-508

Numdam
On codes having no finite completion

Nguyen Huong Lam

Access to full text
Full (PDF)
Full (DJVU)
p. 145-155

Numdam
Schützenberger-like products in non-free monoids

Redziejowski, Roman R.

Access to full text
Full (PDF)
Full (DJVU)
p. 209-226

Numdam
Entiers intuitionnistes et entiers classiques en λC-calcul

Nour, K.

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

Numdam
Optimal on-line coloring of circular arc graphs

Ślusarek, Maciej

Access to full text
Full (PDF)
Full (DJVU)
p. 423-429

Numdam
Cutwidth of the de Bruijn graph

Raspaud, André ; Sýkora, Ondrej ; Vrt'o, Imrich

Access to full text
Full (PDF)
Full (DJVU)
p. 509-514

Numdam
On-line computations of the ideal lattice of posets

Jard, Claude ; Jourdan, Guy-Vincent ; Rampon, Jean-Xavier

Access to full text
Full (PDF)
Full (DJVU)
p. 227-244

Numdam
Sémantique du parallélisme et du choix du langage Electre

Huou, M. ; Elloy, J.-P.

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

Numdam
On-line evaluation of powers using Euclid's algorithm

Brlek, Srećko ; Castéran, Pierre ; Habsieger, Laurent ; Mallette, Richard

Access to full text
Full (PDF)
Full (DJVU)
p. 431-450

Numdam
Une condition impliquant toutes les identités rationnelles

Boffa, M.

Access to full text
Full (PDF)
Full (DJVU)
p. 515-518

Numdam
Comments on the analysis of parameters in a Random Graph Model

Prodinger, Helmut

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

Numdam