Sommaire

Preface

Holzer, Markus ; Truthe, Bianca

Access to full text
p. 1-2

Numdam
One-Rule Length-Preserving Rewrite Systems and Rational Transductions

Latteux, Michel ; Roos, Yves

Access to full text
p. 149-171

Numdam
Special issue in the honor of the 14th “Journées Montoises d'Informatique Théorique”

Jungers, Raphael ; Bruyère, Véronique ; Hollanders, Romain ; Rigo, Michel

Access to full text
p. 247

Numdam
Binary patterns in binary cube-free words: Avoidability and growth

Mercaş, Robert ; Ochem, Pascal ; Samsonov, Alexey V. ; Shur, Arseny M.

Access to full text
p. 369-389

Numdam
Systems of parallel communicating restarting automata

Vollweiler, Marcel ; Otto, Friedrich

Access to full text
p. 3-22

Numdam
Incremental DFA minimisation

Almeida, Marco ; Moreira, Nelma ; Reis, Rogério

Access to full text
p. 173-186

Numdam
Connectedness of fractals associated with Arnoux-Rauzy substitutions

Berthé, Valérie ; Jolivet, Timo ; Siegel, Anne

Access to full text
p. 249-266

Numdam
Bouquets of circles for lamination languages and complexities

Narbel, Philippe

Access to full text
p. 391-418

Numdam
Reaction automata working in sequential manner

Okubo, Fumiya

Access to full text
p. 23-38

Numdam
On the state complexity of semi-quantum finite automata

Zheng, Shenggen ; Gruska, Jozef ; Qiu, Daowen

Access to full text
p. 187-207

Numdam
Root clustering of words

Lischke, Gerhard

Access to full text
p. 267-280

Numdam
Finite repetition threshold for large alphabets

Badkobeh, Golnaz ; Crochemore, Maxime ; Rao, Michaël

Access to full text
p. 419-430

Numdam
Bidirectional string assembling systems

Kutrib, Martin ; Wendlandt, Matthias

Access to full text
p. 39-59

Numdam
A Generalized Model of PAC Learning and its Applicability

Brodag, Thomas ; Herbold, Steffen ; Waack, Stephan

Access to full text
p. 209-245

Numdam
A general framework for the derivation of regular expressions

Caron, Pascal ; Champarnaud, Jean-Marc ; Mignot, Ludovic

Access to full text
p. 281-305

Numdam
Tree algebra of sofic tree languages

Aubrun, Nathalie ; Béal, Marie-Pierre

Access to full text
p. 431-451

Numdam
On the classes of languages accepted by limited context restarting automata

Otto, Friedrich ; Černo, Peter ; Mráz, František

Access to full text
p. 61-84

Numdam
Existence of an infinite ternary 64-abelian square-free word

Huova, Mari

Access to full text
p. 307-314

Numdam
The number of binary rotation words

Frid, A. ; Jamet, D.

Access to full text
p. 453-465

Numdam
Transducing by observing length-reducing and painter rules

Hundeshagen, Norbert ; Leupold, Peter

Access to full text
p. 85-105

Numdam
Abelian pattern avoidance in partial words

Blanchet-Sadri, F. ; De Winkle, Benjamin ; Simmons, Sean

Access to full text
p. 315-339

Numdam
5-abelian cubes are avoidable on binary alphabets

Mercaş, Robert ; Saarela, Aleksi

Access to full text
p. 467-478

Numdam
On the invertibility of finite linear transducers

Amorim, Ivone ; Machiavelo, António ; Reis, Rogério

Access to full text
p. 107-125

Numdam
Integers in number systems with positive and negative quadratic Pisot base

Masáková, Z. ; Vávra, T.

Access to full text
p. 341-367

Numdam
Conditional Lindenmayer systems with subregular conditions: The non-extended case

Dassow, Jürgen ; Rudolf, Stefan

Access to full text
p. 127-147

Numdam