Journals
Seminars
Books
Lecture notes
Theses
Authors
OFF
Journals
Seminars
Books
Lecture notes
Theses
Authors
All
All
Author
Title
References
Keywords
Full text
Search
NOT
Between
and
Author
All
Author
Title
Date
References
Keywords
Full text
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Volume 29 (1995)
Issue no. 1
Table of Contents
Algebraic and topological theory of languages
Rhodes, J.
;
Weil, P.
p. 1-44
Uniformly growing backtrack trees
Kemp, Rainer
p. 45-73
A note on read-
k
times branching programs
Jukna, Stasys
p. 75-83
Issue no. 2
Table of Contents
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
p. 85-103
On morphically generated formal power series
Honkala, Juha
p. 105-127
On parallel deletions applied to a word
Kari, Lila
;
Mateescu, Alexandru
;
Paun, Gheorghe
;
Salomaa, Arto
p. 129-144
On codes having no finite completion
Nguyen Huong Lam
p. 145-155
Issue no. 3
Table of Contents
Equations on the semidirect product of a finite semilattice by a
𝒥
-trivial monoid of height
k
Blanchet-Sadri, F.
p. 157-170
Binary trees, fringe thickness and minimum path length
Cameron, Helen
;
Wood, Derick
p. 171-191
Fibrations and recursivity
Mijoule, Richard
p. 193-208
Schützenberger-like products in non-free monoids
Redziejowski, Roman R.
p. 209-226
On-line computations of the ideal lattice of posets
Jard, Claude
;
Jourdan, Guy-Vincent
;
Rampon, Jean-Xavier
p. 227-244
Comments on the analysis of parameters in a Random Graph Model
Prodinger, Helmut
p. 245-253
Issue no. 4
Table of Contents
Analysis of quickselect : an algorithm for order statistics
Mahmoud, Hosam M.
;
Modarres, Reza
;
Smythe, Robert T.
p. 255-276
Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
Maksimenko, Marianne
p. 277-284
Minimum complexity of automatic non sturmian sequences
Tapsoba, T.
p. 285-291
Entiers intuitionnistes et entiers classiques en
λ
C
-calcul
Nour, K.
p. 293-313
Sémantique du parallélisme et du choix du langage Electre
Huou, M.
;
Elloy, J.-P.
p. 315-338
Issue no. 5
Table of Contents
Unavoidable languages, cuts and innocent sets of words
Rosaz, L.
p. 339-382
Token transfer in a faulty network
Diks, Krzysztof
;
Malinowski, Adam
;
Pelc, Andrzej
p. 383-400
Mineurs d'arbres avec racines
Courcelle, B.
;
Pariès, A.
p. 401-422
Optimal on-line coloring of circular arc graphs
Ślusarek, Maciej
p. 423-429
On-line evaluation of powers using Euclid's algorithm
Brlek, Srećko
;
Castéran, Pierre
;
Habsieger, Laurent
;
Mallette, Richard
p. 431-450
Issue no. 6
Table of Contents
Parallel algorithms on interval graphs
Balayogan, V. B.
;
Pandu Rangan, C.
p. 451-470
Complexity of E0L structural equivalence
Salomaa, Kai
;
Wood, Derick
;
Yu, Sheng
p. 471-485
On bandwidth, cutwidth, and quotient graphs
Barth, Dominique
;
Pellegrini, François
;
Raspaud, André
;
Roman, Jean
p. 487-508
Cutwidth of the de Bruijn graph
Raspaud, André
;
Sýkora, Ondrej
;
Vrt'o, Imrich
p. 509-514
Une condition impliquant toutes les identités rationnelles
Boffa, M.
p. 515-518