Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs p. 229 Henrik Brosenne, Matthias Homeister and Stephan Waack Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002011 PDF (195.2 KB)References
Words over an ordered alphabet and suffix permutations p. 249 Jean-Pierre Duval and Arnaud Lefebvre Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002012 PDF (121.8 KB)References
Permissive strategies: from parity games to safety games p. 261 Julien Bernet, David Janin and Igor Walukiewicz Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002013 PDF (164.3 KB)References
On the Size of One-way Quantum Finite Automata with Periodic Behaviors p. 277 Carlo Mereghetti and Beatrice Palano Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002014 PDF (186.0 KB)References
On multiplicatively dependent linear numeration systems, and periodic points p. 293 Christiane Frougny Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002015 PDF (225.0 KB)References
Density of Critical Factorizations p. 315 Tero Harju and Dirk Nowotka Published online: 15 December 2002 DOI: https://doi.org/10.1051/ita:2002016 PDF (142.0 KB)References