Informatique Théorique et Applications, Volume 36, 2002

Volume 36, Number 1, January-March 2002

• Filippo Mignosi, Luca Q. Zamboni:
  A Note on a Conjecture of Duval and Sturmian Words. 1-3
  
• Symeon Bozapalidis, Olympia Louscou-Bozapalidou:
  Polypodic codes. 5-28
  
• Victor L. Selivanov:
  Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies. 29-42
  
• Martin Beran:
  Pipelined Decomposable BSP Computers. 43-65
  
• Arturo Carpi, Aldo de Luca:
  On the distribution of characteristic parameters of words. 67-96
  
• Arturo Carpi, Aldo de Luca:
  On the distribution of characteristic parameters of words II. 97-127
  

Volume 36, Number 2, April-June 2002

• Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
  A Fully Equational Proof of Parikh's Theorem. 129-153
  
• Levent Erkök, John Launchbury, Andrew Moran:
  Semantics of value recursion for Monadic Input/Output. 155-180
  
• Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
  Feedback, trace and fixed-point semantics. 181-194
  
• Luigi Santocanale:
  µ-Bicomplete Categories and Parity Games. 195-227
  

Volume 36, Number 3, July-September 2002

• Henrik Brosenne, Matthias Homeister, Stephan Waack:
  Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. 229-247
  
• Jean-Pierre Duval, Arnaud Lefebvre:
  Words over an ordered alphabet and suffix permutations. 249-259
  
• Julien Bernet, David Janin, Igor Walukiewicz:
  Permissive strategies: from parity games to safety games. 261-275
  
• Carlo Mereghetti, Beatrice Palano:
  On the Size of One-way Quantum Finite Automata with Periodic Behaviors. 277-291
  
• Christiane Frougny:
  On multiplicatively dependent linear numeration systems, and periodic points. 293-314
  
• Tero Harju, Dirk Nowotka:
  Density of Critical Factorizations. 315-327
  

Volume 36, Number 4, October-December 2002

• Michele Zito:
  An Upper Bound on the Space Complexity of Random Formulae in Resolution. 329-339
  
• Véronique Cortier:
  About the decision of reachability for register machines. 341-358
  
• Pierre-Cyrille Héam:
  On Shuffle Ideals. 359-384
  
• Jacques Justin, Giuseppe Pirillo:
  On a characteristic property of ARNOUX-RAUZY sequences. 385-388
  
• Matthieu Latapy:
  Integer Partitions, Tilings of 2D-gons and Lattices. 389-399
  

Last update Sat May 25 16:19:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page