Sommaire

Éditorial

ITA

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

Numdam
Trace languages defined by regular string languages

Aalbersberg, Ijsbrand Jan ; Welzl, Emo

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

Numdam
A parametric analysis of the largest induced tree problem in random graphs

Protasi, M. ; Talamo, M.

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

Numdam
On frontiers of regular trees

Thomas, Wolfgang

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

Numdam
Über die implementierung redundanzfreier Codes zur datenverschlüsselung

Jürgensen, H. ; Kunze, M.

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

Numdam
Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif

Métivier, Yves

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

Numdam
Outils et résultats pour les transducteurs boustrophédons

Rozoy, Brigitte

Access to full text
Full (PDF)
Full (DJVU)
p. 221-250

Numdam
Point-fixe sur un ensemble restreint

Lieu, Choun Tong

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

Numdam
The topological structure of adherences of regular languages

Head, Tom

Access to full text
Full (PDF)
Full (DJVU)
p. 31-41

Numdam
Graph congruences and pair testing

Brzozowski, J. A. ; Knast, Robert

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

Numdam
Continuous monoids and yields of infinite trees

Dauchet, M. ; Timmerman, E.

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

Numdam
A decision method for the recognizability of sets defined by number systems

Honkala, Juha

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

Numdam
Decidability of periodicity for infinite words

Pansiot, Jean-Jacques

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

Numdam
La fonction d'Ackermann : un nouveau mode de dérécursivation

Arsac, Jacques

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

Numdam
Une approche quantitative de l'exclusion mutuelle

Françon, Jean

Access to full text
Full (PDF)
Full (DJVU)
p. 275-289

Numdam
Coordinated pair systems ; part I : Dyck works and classical pumping

Ehrenfeucht, A. ; Hoogeboom, H. J. ; Rozenberg, G.

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

Numdam
On the periodicity of morphisms on free monoids

Harju, Tero ; Linna, Matti

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

Numdam
Complément à l'étude des suites de Thue-Morse généralisées

Séébold, Patrice

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

Numdam
Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages

Darondeau, Ph.

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

Numdam
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma

Ehrenfeucht, A. ; Hoogeboom, H. J. ; Rozenberg, G.

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

Numdam
Single-tape reset machines

Greibach, S. A. ; Wrathall, C.

Access to full text
Full (PDF)
Full (DJVU)
p. 55-77

Numdam
A simple proof of Valiant's lemma

Walter, Hermann K.-G.

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

Numdam
Every commutative quasirational language is regular

Kortelainen, Juha

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

Numdam
Calcul de la distance par les sous-mots

Hebrard, Jean-Jacques ; Crochemore, Maxime

Access to full text
Full (PDF)
Full (DJVU)
p. 441-456

Numdam
The complexity of the travelling repairman problem

Afrati, Foto ; Cosmadakis, Stavros ; Papadimitriou, Christos H. ; Papageorgiou, George ; Papakostantinou, Nadia

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

Numdam
How much semigroup structure is needed to encode graphs ?

Goralčík, P. ; Goralčíková, A. ; Koubek, V.

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

Numdam
The local and global varieties induced by nilpotent monoids

Weiss, Alex

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

Numdam
Ogden's lemma for nonterminal bounded languages

Boonyavatana, R. ; Slutzki, G.

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

Numdam
Each regular code is included in a maximal regular code

Ehrenfeucht, A. ; Rozenberg, G.

Access to full text
Full (PDF)
Full (DJVU)
p. 89-96

Numdam
Varieties of finite categories

Weiss, Alex ; Therien, Denis

Access to full text
Full (PDF)
Full (DJVU)
p. 357-366

Numdam
Dénombrements de chemins dans ℝ 2 soumis à contraintes

Arques, Didier

Access to full text
Full (PDF)
Full (DJVU)
p. 473-482

Numdam
On infinitary finite length codes

Staiger, Ludwig

Access to full text
Full (PDF)
Full (DJVU)
p. 483-494

Numdam