Journals
Seminars
Conferences
Books
Lecture notes
Theses
Authors
OFF
Journals
Seminars
Conferences
Books
Lecture notes
Theses
Authors
Browse issues
All
All
Author
Title
References
Full text
Search
NOT
Between
and
Author
All
Author
Title
Date
References
Keywords
Full text
Previous
RAIRO. Theoretical Informatics and Applications
Volume 48 (2014)
no. 4
Next
Volume 48 (2014) no. 4
Table of contents
Binary patterns in binary cube-free words: Avoidability and growth
Mercaş, Robert
;
Ochem, Pascal
;
Samsonov, Alexey V.
;
Shur, Arseny M.
p. 369-389
Bouquets of circles for lamination languages and complexities
Narbel, Philippe
p. 391-418
Finite repetition threshold for large alphabets
Badkobeh, Golnaz
;
Crochemore, Maxime
;
Rao, Michaël
p. 419-430
Tree algebra of sofic tree languages
Aubrun, Nathalie
;
Béal, Marie-Pierre
p. 431-451
The number of binary rotation words
Frid, A.
;
Jamet, D.
p. 453-465
5-abelian cubes are avoidable on binary alphabets
Mercaş, Robert
;
Saarela, Aleksi
p. 467-478