Fundamenta Informaticae, Volume 74

Volume 74, Number 1, 2006

• Gregor Engels, Fernando Orejas, Francesco Parisi-Presicce:
  Special Issue with Selected Papers from ICGT 2004.
  
• Hartmut Ehrig, Julia Padberg, Ulrike Prange, Annegret Habel:
  Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. 1-29
  
• Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, Gabriele Taentzer:
  Fundamental Theory for Typed Attributed Graphs and Graph Transformation based on Adhesive HLR Categories. 31-61
  
• Reiko Heckel, Georgios Lajios, Sebastian Menge:
  Stochastic Graph Transformation Systems. 63-84
  
• Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
  Local Computations in Graphs: The Case of Cellular Edge Local Computations. 85-114
  
• Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
  The Embedding Problem for Switching Classes of Graphs. 115-134
  
• Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann:
  Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. 135-166
  

Volume 74, Number 2-3, 2006

• Marek A. Bednarczyk:
  Limits of Modularity. 167-187
  
• Chin-Chen Chang, Chih-Yang Lin: Reversible Data Embedding Based on Prediction Approach for VQ and SMVQ Compressed Images. 189-207
• Georgi Dimov, Dimiter Vakarelov:
  Contact Algebras and Region-based Theory of Space: A Proximity Approach - I. 209-249
  
• Georgi Dimov, Dimiter Vakarelov:
  Contact Algebras and Region-based Theory of Space: Proximity Approach - II. 251-282
  
• Ivo Düntsch, Michael Winter:
  Rough Relation Algebras Revisited. 283-300
  
• Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zhang:
  A Categorical View on Algebraic Lattices in Formal Concept Analysis. 301-328
  
• Bala Kalyanasundaram, Mahendran Velauthapillai:
  Capabilities of Thoughtful Machines. 329-340
  
• Saralees Nadarajah, Samuel Kotz:
  The Linear Combination of Logistic and Gumbel Random Variables. 341-350
  
• Mohak Shah, Marina Sokolova, Stan Szpakowicz:
  Process-Specific Information for Learning Electronic Negotiation Outcomes. 351-373
  
• Marcin Szpyrka:
  Analysis of RTCP-nets with Reachability Graphs. 375-390
  

Volume 74, Number 4, 2006

• Maurice Margenstern:
  Machines, Computations and Universality.
  
• Artiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron:
  (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. 391-408
  
• Olivier Bournez, Emmanuel Hainry:
  Recursive Analysis Characterized as a Class of Real Recursive Functions. 409-433
  
• Fabio Burderi, Giuseppa Castiglione, Antonio Restivo:
  Higman's Theorem on Discrete Sets. 435-446
  
• Matteo Cavaliere, Peter Leupold:
  Observation of String-Rewriting Systems. 447-462
  
• Jean-Charles Delvenne, Petr Kurka, Vincent D. Blondel:
  Decidability and Universality in Symbolic Dynamical Systems. 463-490
  
• Jérôme Durand-Lose:
  Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers. 491-510
  
• Markus Holzer, Martin Kutrib:
  Variable Complexity of Simple Programs. 511-528
  
• Alberto Leporati, Claudio Zandron, Giancarlo Mauri:
  Reversible P Systems to Simulate Fredkin Circuits. 529-548
  
• Jean Neraud:
  On the Completion of Codes in Submonoids with Finite Rank. 549-562
  
• Alexander Okhotin:
  Computational Universality in One-variable Language Equations. 563-578
  
• René Schott, Jean-Claude Spehner:
  Shuffle of Words and Araucaria Trees. 579-601
  
• Hiroshi Umeo, Masashi Maeda, Masaya Hisaoka, Masato Teraoka:
  A State-Efficient Mapping Scheme for Designing Two-Dimensional Firing Squad Synchronization Algorithms. 603-623