Tome 43 (2009) no. 1

Sommaire

Inf-datalog, modal logic and complexities
p. 1-21
Equations on partial words
p. 23-39
On critical exponents in fixed points of k-uniform binary morphisms
p. 41-68
Hyper-minimizing minimized deterministic finite state automata
p. 69-94
Hierarchies and reducibilities on regular languages related to modulo counting
p. 95-132
Cycle and path embedding on 5-ary N-cubes
p. 133-144
Palindromic complexity of infinite words associated with non-simple Parry numbers
p. 145-163
Least periods of factors of infinite words
p. 165-178