Fundamenta Informaticae, Volume 92

Volume 92, Numbers 1-2, 2009

• Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
  Undecidability Results for Timed Automata with Silent Transitions. 1-25
  
• Chin-Chen Chang, Tzungher Chen, Li-Jen Liu:
  Preventing Cheating in Computational Visual Cryptography. 27-42
  
• Jacek Czerniak:
  Evolutionary Approach to Data Discretization for Rough Sets Theory. 43-61
  
• Kimmo Fredriksson, Fedor Nikitin:
  Simple Random Access Compression. 63-81
  
• Sven Hartmann, Sebastian Link:
  On Inferences ofWeak Multivalued Dependencies. 83-102
  
• Johanna Högberg, Andreas Maletti, Heiko Vogler:
  Bisimulation Minimisation of Weighted Automata on Unranked Trees. 103-130
  
• Kuo Lung Hung, Shin-Wei He:
  Feature Based Affine Invariant Watermarking Robust to Geometric Distortions. 131-143
  
• Rakesh Verma:
  Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems. 145-168
  
• Pawel Waszkiewicz:
  On Domain Theory over Girard Quantales. 169-192
  

Volume 92, Number 3, 2009

• Eugénie Foustoucos, Labrini Kalantzi:
  The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach. 193-231
  
• Karsten Hölscher, Hans-Jörg Kreowski, Sabine Kuske:
  Autonomous Units to Model Interacting Sequential and Parallel Processes. 233-257
  
• Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko:
  Greedy Algorithm for Construction of Partial Association Rules. 259-277
  
• Jacek Sroka, Jan Hidders:
  Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I. 279-299
  
• Yinbin Lei, Maokang Luo:
  A Proof of Plotkin's Conjecture. 301-306
  

Volume 92, Number 4, 2009

• Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
  Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions. 307-343
  
• Anindya Halder, Ashish Ghosh, Susmita Ghosh:
  Aggregation Pheromone Density Based Pattern Classification. 345-362
  
• Anthony Spatharis, Ilias Foudalis, Martha Sideri, Christos H. Papadimitriou:
  Comparing Trade-off Based Models of the Internet. 363-372
  
• Jacek Sroka, Jan Hidders:
  Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II. 373-396
  
• Cheng-Hsing Yang, Chi-Yao Weng, Shiuh-Jeng Wang, Hung-Min Sun:
  Codebook-linked Watermarking Scheme for Digital Images. 397-409
  
• Sheng Zhong:
  On Distributed k-Anonymization. 411-431