Sommaire

Foreword

Bruyère, V. ; Rigo, M.

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

Numdam
Unambiguous erasing morphisms in free monoids

Schneider, Johannes C.

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

Numdam
On the D0L repetition threshold

Goldstein, Ilya

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

Numdam
Quantum coherent spaces and linear logic

Baratella, Stefano

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

Numdam
Morphisms fixing words associated with exchange of three intervals

Ambrož, Petr ; Masáková, Zuzana ; Pelantová, Edita

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

Numdam
Generalizations of Parikh mappings

Černý, Anton

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

Numdam
Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search

Cáceres, E. N. ; Song, S. W. ; Szwarcfiter, J. L.

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

Numdam
Sturmian jungle (or garden?) on multiliteral alphabets

Balková, L'ubomíra ; Pelantová, Edita ; Starosta, Štěpán

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

Numdam
Radix enumeration of rational languages

Angrand, Pierre-Yves ; Sakarovitch, Jacques

Access to full text
Full (PDF)
Full (DJVU)
p. 19-36

Numdam
Extending regular expressions with homomorphic replacement

Bordihn, Henning ; Dassow, Jürgen ; Holzer, Markus

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

Numdam
Balances and abelian complexity of a certain class of infinite ternary words

Turek, Ondřej

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

Numdam
Classes of two-dimensional languages and recognizability conditions

Anselmo, Marcella ; Madonia, Maria

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

Numdam
On the computation of covert channel capacity

Asarin, Eugene ; Dima, Cătălin

Access to full text
Full (PDF)
Full (DJVU)
p. 37-58

Numdam
On the syntactic complexity of tree series

Bozapalidis, Symeon ; Kalampakas, Antonios

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

Numdam
Corrigendum to our paper : How expressions can code for automata

Lombardy, Sylvain ; Sakarovitch, Jacques

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

Numdam
The code problem for directed figures

Kolarz, Michał

Access to full text
Full (PDF)
Full (DJVU)
p. 489-506

Numdam
How to build billiard words using decimations

Borel, Jean-Pierre

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

Numdam
The uniform minimum-ones 2SAT problem and its application to haplotype classification

Böckenhauer, Hans-Joachim ; Forišek, Michal ; Oravec, Ján ; Steffen, Björn ; Steinhöfel, Kathleen ; Steinová, Monika

Access to full text
Full (PDF)
Full (DJVU)
p. 363-377

Numdam
Translation from classical two-way automata to pebble two-way automata

Geffert, Viliam ; Ištoňová, L'ubomíra

Access to full text
Full (PDF)
Full (DJVU)
p. 507-523

Numdam
Formal language properties of hybrid systems with strong resets

Brihaye, Thomas ; Bruyère, Véronique ; Render, Elaine

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

Numdam
Function operators spanning the arithmetical and the polynomial hierarchy

Hemmerling, Armin

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

Numdam
A CAT algorithm for the exhaustive generation of ice piles

Massazza, Paolo ; Radicioni, Roberto

Access to full text
Full (PDF)
Full (DJVU)
p. 525-543

Numdam
Infinite words containing squares at every position

Currie, James ; Rampersad, Narad

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

Numdam
On the number of squares in partial words

Halava, Vesa ; Harju, Tero ; Kärki, Tomi

Access to full text
Full (PDF)
Full (DJVU)
p. 125-138

Numdam
The critical exponent of the Arshon words

Krieger, Dalia

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

Numdam
Binary words avoiding the pattern AABBCABBA

Ochem, Pascal

Access to full text
Full (PDF)
Full (DJVU)
p. 151-158

Numdam
Standard factors of sturmian words

Richomme, Gwénaël ; Saari, Kalle ; Zamboni, Luca Q.

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

Numdam
On the growth rates of complexity of threshold languages

Shur, Arseny M. ; Gorbunova, Irina A.

Access to full text
Full (PDF)
Full (DJVU)
p. 175-192

Numdam