Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 42 (2008)
no. 3
Précédent
Suivant
Volume 42 (2008) no. 3
Sommaire
Preface
Caucal, Didier
;
Siegel, Anne
p. 415
A hierarchy of automatic
ω
-words having a decidable MSO theory
Bárány, Vince
p. 417-450
Some algebraic properties of machine poset of infinite words
Belovs, Aleksandrs
p. 451-466
From bi-ideals to periodicity
Buls, Jānis
;
Lorencs, Aivars
p. 467-475
Dejean's conjecture and letter frequency
Chalopin, Jérémie
;
Ochem, Pascal
p. 477-480
A new algebraic invariant for weak equivalence of sofic subshifts
Chaubard, Laura
;
Costa, Alfredo
p. 481-502
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
Giambruno, Laura
;
Restivo, Antonio
p. 503-524
Parikh test sets for commutative languages
Holub, Štěpán
p. 525-537
Compatibility relations on codes and free monoids
Kärki, Tomi
p. 539-552
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata
Kirsten, Daniel
p. 553-581
On varieties of literally idempotent languages
Klíma, Ondřej
;
Polák, Libor
p. 583-598
Drunken man infinite words complexity
Gonidec, Marion Le
p. 599-613
Traces of term-automatic graphs
Meyer, Antoine
p. 615-630
Two sided sand piles model and unimodal sequences
Thi Ha Duong Phan
p. 631-646
Comparing complexity functions of a language and its extendable part
Shur, Arseny M.
p. 647-655