Adhesive High-Level Replacement Systems:
A New Categorical Framework for Graph Transformation
Hartmut Ehrig, Julia Padberg and Ulrike Prange and Annegret Habel
Fundamental Theory for Typed Attributed Graphs
and Graph Transformation based on Adhesive HLR Categories
Hartmut Ehrig, Karsten Ehrig, Ulrike Prange and Gabriele
Taentzer
Stochastic Graph Transformation Systems
Reiko Heckel, Georgios Lajios and Sebastian Menge
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Jérémie Chalopin, Yves Métivier and Wiesław
Zielonka
The Embedding Problem for Switching Classes of Graphs
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju and Grzegorz
Rozenberg
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Hartmut Ehrig, Karsten Ehrig, Annegret Habel and Karl-Heinz Pennemann
Limits of Modularity
Marek A. Bednarczyk
Reversible Data Embedding Based on Prediction
Approach for VQ and SMVQ Compressed Images
Chin-Chen Chang and Chih-Yang Lin
Contact Algebras and Region-based Theory of Space:
A Proximity Approach - I
Georgi Dimov and Dimiter Vakarelov
Contact Algebras and Region-based Theory of Space:
Proximity Approach - II
Georgi Dimov and Dimiter Vakarelov
Rough Relation Algebras Revisited
Ivo Düntsch and Michael Winter
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Pascal Hitzler, Markus Krötzsch and Guo-Qiang
Zhang
Capabilities of Thoughtful Machines
Bala Kalyanasundaram and Mahe Velauthapillai
The Linear Combination of Logistic and Gumbel Random Variables
Saralees Nadarajah and Samuel Kotz
Process-Specific Information for Learning Electronic Negotiation Outcomes
Mohak Shah, Marina Sokolova and Stan Szpakowicz
Analysis of RTCP-nets with Reachability Graphs
Marcin Szpyrka
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Artiom Alhazov, Rudolf Freund, Alberto Leporati,
Marion Oswald and Claudio Zandron
Recursive Analysis Characterized as a Class of
Real Recursive Functions
Olivier Bournez and Emmanuel Hainry
Higman's Theorem on Discrete Sets
Fabio Burderi, Giuseppa Castiglione and Antonio Restivo
Observation of String-Rewriting Systems
Matteo Cavaliere and Peter Leupold
Decidability and Universality in Symbolic Dynamical Systems
Jean-Charles Delvenne, Petr Krka and Vincent
Blondel
Abstract Geometrical Computation 1:
Embedding Black Hole Computations with Rational Numbers
Jérôme Durand-Lose
Variable Complexity of Simple Programs
Markus Holzer and Martin Kutrib
Reversible P Systems to Simulate Fredkin Circuits
Alberto Leporati, Claudio Zandron and Giancarlo Mauri
On the Completion of Codes in Submonoids with Finite Rank
Jean Néraud
Computational Universality in One-variable Language
Equations
Alexander Okhotin
Shuffle of Words and Araucaria Trees
René Schott and Jean-Claude Spehner
A State-Efficient Mapping Scheme for Designing
Two-Dimensional Firing Squad Synchronization Algorithms
Hiroshi Umeo, Masashi Maeda, Masaya Hisaoka and Masato
Teraoka