Informatique Théorique et Applications, Volume 40, 2006

Volume 40, Number 1, January-March 2006

• Sylvain Lombardy, Jean Mairesse:
  Series which are both max-plus and min-plus rational are unambiguous. 1-14
  
• Jean-Pierre Borel, Christophe Reutenauer:
  On Christoffel classes. 15-27
  
• Clelia de Felice:
  On a complete set of operations for factorizing codes. 29-52
  
• Dietrich Kuske:
  Theories of orders on the set of words. 53-74
  
• Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
  Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. 75-91
  

Volume 40, Number 2, April-June 2006

• Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli:
  Preface.
  
• Diego de Falco, Dario Tamascelli:
  Entropy generation in a model of reversible computation. 93-105
  
• Mauro Torelli:
  Increasing integer sequences and Goldbach's conjecture. 107-121
  
• Paola Campadelli, Raffaella Lanzarotti, Giuseppe Lipori:
  Eye localization for face recognition. 123-139
  
• Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron:
  Complexity classes for membrane systems. 141-162
  
• Giorgio Valentini, Francesca Ruffino:
  Characterization of lung tumor subtypes through gene expression cluster validity assessment. 163-176
  
• Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente:
  Different time solutions for the firing squad synchronization problem on basic grid networks. 177-206
  
• Massimiliano Goldwurm, Roberto Radicioni:
  Probabilistic models for pattern statistics. 207-225
  
• Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna:
  Graph fibrations, graph isomorphism, and PageRank. 227-253
  
• Olivier Carton, Christian Choffrut, Serge Grigorieff:
  Decision problems among the main subfamilies of rational relations. 255-275
  
• Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo:
  Unambiguous recognizable two-dimensional languages. 277-293
  
• Paolo Massazza, Petri Salmela:
  On the simplest centralizer of a language. 295-301
  
• Danilo Bruschi, Giovanni Pighizzini:
  String distances and intrusion detection: Bridging the gap between formal languages and computer security. 303-313
  
• Carlo Mereghetti, Beatrice Palano:
  Quantum finite automata with control language. 315-332
  
• Gianpiero Cattaneo, Alberto Dennunzio, Fabio Farina:
  A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages. 333-352
  
• Mauro Birattari, Mark Zlochin, Marco Dorigo:
  Towards a theory of practice in metaheuristics design: A machine learning perspective. 353-369
  
• Giuliano Grossi, Massimo Marchi, Roberto Posenato:
  Solving maximum independent set by asynchronous distributed hopfield-type neural networks. 371-388
  
• Peter Auer, Nicolò Cesa-Bianchi:
  A distributed voting scheme to maximize preferences. 389-403
  

Volume 40, Number 3, July-September 2006

• Gwénaël Richomme:
  Foreword. 405-405
  
• Flavio D'Alessandro, Stefano Varricchio:
  Well quasi-orders, unavoidable sets, and derivation systems. 407-426
  
• Pascal Ochem:
  A generator of morphisms for infinite words. 427-441
  
• Anna E. Frid:
  On possible growths of arithmetical complexity. 443-458
  
• Tomi Kärki:
  Transcendence of numbers with an expansion in a subclass of complexity 2n+1. 459-471
  
• Shandy Brown, Narad Rampersad, Jeffrey Shallit, Troy Vasiga:
  Squares and overlaps in the Thue-Morse sequence and some variants. 473-484
  
• Galina Jirásková:
  Deterministic blow-ups of minimal NFA's. 485-499
  
• Galina Jirásková:
  Note on the complexity of Las Vegas automata problems. 501-510
  
• Isabelle Fagnot:
  A little more about morphic Sturmian words. 511-518
  

Volume 40, Number 4, October-December 2006

• Stéphane Vialette:
  Packing of (0, 1)-matrices. 519-535
  
• Symeon Bozapalidis, Archontia Grammatikopoulou:
  Picture codes. 537-550
  
• Vesa Halava, Tero Harju:
  Undecidability of infinite post correspondence problem for instances of Size 9. 551-557
  
• Francesc Carreras, Antonio Magaña, Carlos Munuera:
  The accessibility of an access structure. 559-567
  
• Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid:
  Sequences of low arithmetical complexity. 569-582
  
• Stepan Holub:
  On multiperiodic words. 583-591
  
• Anne Micheli, Dominique Rossin:
  Edit distance between unlabeled ordered trees. 593-609
  
• Viliam Geffert, Lubomíra Istonová:
  Conversion of regular expressions into realtime automata. 611-629
  

Last update Mon Feb 13 04:50:59 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page