RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 36 (2002) no. 3

Table of contents

Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs

Brosenne, Henrik; Homeister, Matthias; Waack, Stephan

p. 229-247

Words over an ordered alphabet and suffix permutations

Duval, Jean-Pierre; Lefebvre, Arnaud

p. 249-259

Permissive strategies : from parity games to safety games

Bernet, Julien; Janin, David; Walukiewicz, Igor

p. 261-275

On the size of one-way quantum finite automata with periodic behaviors

Mereghetti, Carlo; Palano, Beatrice

p. 277-291

On multiplicatively dependent linear numeration systems, and periodic points

Frougny, Christiane

p. 293-314

Density of critical factorizations

Harju, Tero; Nowotka, Dirk

p. 315-327