Tome 36 (2002) no. 3

Sommaire

Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs
p. 229-247
Words over an ordered alphabet and suffix permutations
p. 249-259
Permissive strategies : from parity games to safety games
p. 261-275
On the size of one-way quantum finite automata with periodic behaviors
p. 277-291
On multiplicatively dependent linear numeration systems, and periodic points
p. 293-314
Density of critical factorizations
p. 315-327