Volume 42 (2008) no. 3

Table of contents

Preface
p. 415
A hierarchy of automatic ω-words having a decidable MSO theory
p. 417-450
Some algebraic properties of machine poset of infinite words
p. 451-466
From bi-ideals to periodicity
p. 467-475
Dejean's conjecture and letter frequency
p. 477-480
A new algebraic invariant for weak equivalence of sofic subshifts
p. 481-502
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
p. 503-524
Parikh test sets for commutative languages
p. 525-537
Compatibility relations on codes and free monoids
p. 539-552
A burnside approach to the termination of Mohri's algorithm for polynomially ambiguous Min-Plus-automata
p. 553-581
On varieties of literally idempotent languages
p. 583-598
Drunken man infinite words complexity
p. 599-613
Traces of term-automatic graphs
p. 615-630
Two sided sand piles model and unimodal sequences
p. 631-646
Comparing complexity functions of a language and its extendable part
p. 647-655